DTTF/NB479: Dszquphsbqiz Day 25

Slides:

Advertisements

Similar presentations

1 Key Exchange Solutions Diffie-Hellman Protocol Needham Schroeder Protocol X.509 Certification.

Advertisements

Announcements: 1. Term project groups and topics due midnight 2. HW6 due next Tuesday. Questions? This week: Primality testing, factoring Primality testing,

Announcements: 1. Term project groups and topics due tomorrow midnight Waiting for posts from most of you. Questions? This week: Primality testing, factoring.

Announcements: 1. Pass in Homework 5 now. 2. Term project groups and topics due by Friday 1.Can use discussion forum to find teammates 3. HW6 posted, due.

HW6 due tomorrow Teams T will get to pick their presentation day in the order Teams T will get to pick their presentation day in the orderQuestions? Review.

Announcements: 1. Class cancelled tomorrow 2. HW7 due date moved to Thursday. Questions? This week: Birthday attacks, Digital signatures Birthday attacks,

Announcements: 1. Short “pop” quiz on Ch 3 (today?) 2. Term project groups and topics due midnight 3. HW6 due Tuesday. Questions? This week: Primality.

Announcements: 1. Short “pop” quiz on Ch 3 (today?) 2. Term project groups and topics formed 3. HW6 due tomorrow. Questions? This week: Discrete Logs,

Introduction to Modern Cryptography Homework assignments.

Announcements: 1. Short “pop” quiz on Ch 3 (not today) 2. Term project groups and topics due tomorrow midnight Waiting for posts from 22 of you. 3. HW6:

Pass in HW6 now Can use up to 2 late days Can use up to 2 late days But one incentive not to burn them all: teams will get to pick their presentation day.

Announcements: 1. HW6 due now 2. HW7 posted Questions? This week: Discrete Logs, Diffie-Hellman, ElGamal Discrete Logs, Diffie-Hellman, ElGamal Hash Functions.

Discrete Log 1 Discrete Log. Discrete Log 2 Discrete Logarithm  Discrete log problem:  Given p, g and g a (mod p), determine a o This would break Diffie-Hellman.

Announcements: 1. Late HW7’s now. Questions? This week: Birthday attacks, Digital signatures, DSA Birthday attacks, Digital signatures, DSA DTTF/NB479:

Announcements: 1. Term project groups and topics formed 2. HW6 due tomorrow. Questions? This week: Discrete Logs, Diffie-Hellman, ElGamal Discrete Logs,

CSCI 172/283 Fall 2010 Public Key Cryptography. New paradigm introduced by Diffie and Hellman The mailbox analogy: Bob has a locked mailbox Alice can.

Public Key Model 8. Cryptography part 2.

Lecture 7 Discrete Logarithms

HW6 due tomorrow Teams T will get to pick their presentation day in the order Teams T will get to pick their presentation day in the order Teams mostly.

TODAY IN ALGEBRA 2.0…  REVIEW: 7.5 Expand and Condense LOGs  COMPLETE: HW #6  Learning Target: 7.6 You will solve exponential equations by changing.

Announcements: HW4 – DES due Thursday HW4 – DES due Thursday I have installed, or will install: Java, C (gcc), Python. What other languages? Please make.

LOGARITHMIC EQUATIONS. CREATE A LOGARITHMIC EQUATION  Create a logarithmic function of the form  f(x) = log b (x-h) + k.

NATURAL LOGARITHMS. The Constant: e e is a constant very similar to π. Π = … e = … Because it is a fixed number we can find e 2.

Cryptography issues – elliptic curves Presented by Tom Nykiel.

TODAY IN ALGEBRA 2.0…  REVIEW: Solving Exponential Equations  Learning Target 1: 7.6 You will solve exponential equations by using logarithms  Independent.

TODAY IN ALGEBRA 2.0…  REVIEW: HW #3 Exponential Growth and Decay  Learning Target 1: 7.4 You will evaluate logarithms.  Independent Practice.

Diffie-Hellman Key Exchange first public-key type scheme proposed by Diffie & Hellman in 1976 along with the exposition of public key concepts – note:

Elgamal Public Key Encryption CSCI 5857: Encoding and Encryption.

4.4 Exponential and Logarithmic Equations. Solve: 2 x = 7 3 x+3 = 5.

Objectives: To further understand the natural exponential e and natural logarithms. To solve equations involving e and ln. To know that e x and lnx are.

MAT 1226 Calculus II Section 6.2* The Natural Logarithmic Function

Model students in my eyes

Product and Quotient Rules

Bell Ringer: What type of correlation is seen here:

Asymmetric Encryption

Topic 26: Discrete LOG Applications

Encryption and Integrity

Key Exchange References: Applied Cryptography, Bruce Schneier

DTTF/NB479: Dszquphsbqiz Day 26

PUBLIC-KEY ENCRYPTION Focusing on RSA

DTTF/NB479: Dszquphsbqiz Day 22

Uses Uses of cryptography Lab today on RSA

Christina Shockley Welcome to AP Calculus AB Christina Shockley

Homework Questions.

IEEE TRANSACTIONS ON INFORMATION THEORY, JULY 1985

Chapter 30 Cryptography Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.

MP3 Final Review January 11, 2017

Homework 3 As announced: not due today 

Hash In-Class Quiz.

Topic 25: Discrete LOG, DDH + Attacks on Plain RSA

Monday, Sept. 19th AGENDA Independent reading – hand out reading logs for this week Introduce 6 week book project “You Matter Monday” activity Read.

Differential Equations Separation of Variables

Diffie-Hellman Key-Exchange Algorithm

Increasing & Decreasing Functions First Derivative Test

刘振上海交通大学计算机科学与工程系电信群楼3-509

Exponential Functions: Differentiation and Integration

Natural Logarithms - Integration

Natural Logarithms - Differentiation

DTTF/NB479: Dszquphsbqiz Day 17

DTTF/NB479: Dszquphsbqiz Day 27

El Gamal and Diffie Hellman

DTTF/NB479: Dszquphsbqiz Day 19

El Gamal and Diffie Hellman

Discrete Log ElGamal Cryptosystem

DTTF/NB479: Dszquphsbqiz Day 25

Introduction to Modern Cryptography

Diffie-Hellman Key Exchange

7.4 Exponential & Logarithmic Equations

刘振上海交通大学计算机科学与工程系电信群楼3-509

Presentation transcript:

DTTF/NB479: Dszquphsbqiz Day 25 Announcements: Term project groups and topics formed HW6 due tomorrow. Questions? This week: Discrete Logs, Diffie-Hellman, ElGamal Hash Functions

Quick humor http://xkcd.com/c247.html Thanks to Ted Lyman, 2007

Discrete Logs Given Find x We denote this as Why is this hard?

Pollig-Hellman Useful when (p-1) has only small prime factors Did long derivation Introduced problem 2x=12 (mod 19) Finish for Homework 6.

Baby Step, Giant Step Like the meet-in-the-middle attack on Double-DES Eve chooses , say She makes 2 tables: and looks for a match. Why should there be one? Write x in base N. Requires ~p comparisons, but only p1/2 exponentiations and space. Works for medium-size primes.

Some things we won’t cover in class about Discrete Logs 7.2.3 Index Calculus: like sieve method of factoring primes The equation on p. 207 might help with some of homework 7. Discrete logs mod 4 and bit commitment We skip to make time for some applications of discrete logs Although the football game prediction analogy is interesting…