© Copyright Martin Tompa, 1999 Secret Codes, Unforgeable Signatures, and Coin Flipping on the Phone Martin Tompa Computer Science & Engineering University.

Slides:

Advertisements

Similar presentations

Asymmetric-Key Cryptography

Advertisements

CSE331: Introduction to Networks and Security Lecture 19 Fall 2002.

Public Key Cryptosystems - RSA Receiver Sender Eavesdroppe r p q p q p q p and q prime.

Data encryption with big prime numbers

hap8.html#chap8ex5.

7. Asymmetric encryption-

Great Theoretical Ideas in Computer Science.

OOP/Java1 Public Key Crytography From: Introduction to Algorithms Cormen, Leiserson and Rivest.

Cryptography 101 How is data actually secured. RSA Public Key Encryption RSA – names after the inventors –Rivest, Shamir, and Adleman Basic Idea: Your.

Public-key Cryptography Montclair State University CMPT 109 J.W. Benham Spring, 1998.

RSA ( Rivest, Shamir, Adleman) Public Key Cryptosystem

Public Key Crytography1 From: Introduction to Algorithms Cormen, Leiserson and Rivest.

Kemal AkkayaWireless & Network Security 1 Department of Computer Science Southern Illinois University Carbondale CS 591 – Wireless & Network Security Lecture.

Cryptography Lecture 11: Oct 12. Cryptography AliceBob Cryptography is the study of methods for sending and receiving secret messages. adversary Goal:

ITIS 3200: Introduction to Information Security and Privacy Dr. Weichao Wang.

Cryptography in Subgroups of Z n * Jens Groth UCLA.

Public Encryption: RSA

WS Algorithmentheorie 03 – Randomized Algorithms (Public Key Cryptosystems) Prof. Dr. Th. Ottmann.

Public Key Cryptography and the RSA Algorithm

Cryptography1 CPSC 3730 Cryptography Chapter 9 Public Key Cryptography and RSA.

Private-Key Cryptography traditional private/secret/single key cryptography uses one key shared by both sender and receiver if this key is disclosed communications.

WS Algorithmentheorie 03 – Randomized Algorithms (Public Key Cryptosystems) Prof. Dr. Th. Ottmann.

Chapter 3 Encryption Algorithms & Systems (Part C)

Dr.Saleem Al_Zoubi1 Cryptography and Network Security Third Edition by William Stallings Public Key Cryptography and RSA.

RSA Encryption Caitlin O’Dwyer. What is an RSA Number? An RSA number n is a number s.t. n=pq Where p and q are distinct, large, prime integers.

“RSA”. RSA  by Rivest, Shamir & Adleman of MIT in 1977  best known & widely used public-key scheme  RSA is a block cipher, plain & cipher text are.

Codes, Ciphers, and Cryptography-RSA Encryption

The RSA Algorithm Based on the idea that factorization of integers into their prime factors is hard. ★ n=p ． q, where p and q are distinct primes Proposed.

 Introduction  Requirements for RSA  Ingredients for RSA  RSA Algorithm  RSA Example  Problems on RSA.

1 CIS 5371 Cryptography 8. Asymmetric encryption-.

Page 1 Secure Communication Paul Krzyzanowski Distributed Systems Except as otherwise noted, the content of this presentation.

Lecture 15 Lecture’s outline Public algorithms (usually) that are each other’s inverse.

Encryption Encryption encodes information to hide it from everyone else … maintaining your privacy.

Great Theoretical Ideas in Computer Science.

Cryptography: RSA & DES Marcia Noel Ken Roe Jaime Buccheri.

10/1/2015 9:38:06 AM1AIIS. OUTLINE Introduction Goals In Cryptography Secrete Key Cryptography Public Key Cryptograpgy Digital Signatures 2 10/1/2015.

Encryption Coursepak little bit in chap 10 of reed.

Cryptography Dec 29. This Lecture In this last lecture for number theory, we will see probably the most important application of number theory in computer.

BASIC CRYPTOGRAPHIC CONCEPTS. Public Key Cryptography  Uses two keys for every simplex logical communication link.  Public key  Private key  The use.

Modular Arithmetic with Applications to Cryptography Lecture 47 Section 10.4 Wed, Apr 13, 2005.

A Method for Obtaining Digital Signatures and Public-key Cryptosystems

Public-Key Encryption

CSCE 715: Network Systems Security Chin-Tser Huang University of South Carolina.

RSA Public Key Crypto System. About RSA Announced in 1977 by Ronald Rivest, Adi Shamir, and Leonard Adleman Relies on the relative ease of finding large.

1 Public-Key Cryptography and Message Authentication.

Cryptography and Network Security Chapter 9 - Public-Key Cryptography

Algebra of RSA codes Yinduo Ma Tong Li. Ron Rivest, Adi Shamir and Leonard Adleman.

The RSA Algorithm. Content Review of Encryption RSA An RSA example.

RSA and its Mathematics Behind July Topics  Modular Arithmetic  Greatest Common Divisor  Euler’s Identity  RSA algorithm  Security in RSA.

Chapter 3 – Public Key Cryptography and RSA (A). Private-Key Cryptography traditional private/secret/single-key cryptography uses one key shared by both.

Public Key Cryptosystems RSA Diffie-Hellman Department of Computer Engineering Sharif University of Technology 3/8/2006.

RSA The algorithm was publicly described in 1977 by Ron Rivest, Adi Shamir, and Leonard Adleman at MIT Partly used for PGP (Pretty Good Privacy) to encrypt.

Chapter 9 Public Key Cryptography and RSA. Private-Key Cryptography traditional private/secret/single key cryptography uses one key shared by both sender.

What use are prime numbers? ?. o All the primes, apart from 2, are odd numbers. o 1 is not a prime number. Why? o There are infinitely many prime numbers!

David Kauchak CS52 – Spring 2015

Encryption CS110: Computer Science and the Internet.

Secret Codes, Unforgeable Signatures, and Coin Flipping on the Phone Martin Tompa Computer Science & Engineering University of Washington.

CS 4803 Fall 04 Public Key Algorithms. Modular Arithmetic n Public key algorithms are based on modular arithmetic. n Modular addition. n Modular multiplication.

Introduction to Cryptography Lecture 9. Public – Key Cryptosystems Each participant has a public key and a private key. It should be infeasible to determine.

Encryption on the Internet Jeff Cohen. Keeping Information Secret What information do we want to be secret? –Credit card number –Social security number.

Computer Security Lecture 5 Ch.9 Public-Key Cryptography And RSA Prepared by Dr. Lamiaa Elshenawy.

Cryptography in the Real World Diffie-Hellman Key Exchange RSA Analysis RSA Performance SSH Protocol Page 1.

Great Theoretical Ideas in Computer Science.

Lecture 3 (Chapter 9) Public-Key Cryptography and RSA Prepared by Dr. Lamiaa M. Elshenawy 1.

Data encryption with big prime numbers DANIEL FREEMAN, SLU.

RSA Cryptosystem Great Theoretical Ideas In Computer Science S. Rudich V. Adamchik CS Spring 2006 Lecture 8Feb. 09, 2006Carnegie Mellon University.

CSCE 715: Network Systems Security Chin-Tser Huang University of South Carolina.

Intro to Cryptography ICS 6D Sandy Irani. Cryptography Intro Alice wants to send a message to Bob so that even if Eve can see the transmitted information,

Modular Arithmetic and RSA Encryption

Rivest, Shamir and Adleman

Presentation transcript:

© Copyright Martin Tompa, 1999 Secret Codes, Unforgeable Signatures, and Coin Flipping on the Phone Martin Tompa Computer Science & Engineering University of Washington

© Copyright Martin Tompa, 1999 Secret Codes, Unforgeable Signatures, and Coin Flipping on the Phone

© Copyright Martin Tompa, 1999 What Is a Cryptosystem? A Sender B Receiver C = E AB (M)M = D AB (C)M K AB

© Copyright Martin Tompa, 1999 What Is a Cryptosystem? A Sender B Receiver Cryptanalyst (bad guy) C = E AB (M)M = D AB (C)M K AB

© Copyright Martin Tompa, 1999 What Is a Cryptosystem? A Sender B Receiver Cryptanalyst (bad guy) C = E AB (M)M = D AB (C)M M C K AB MessageEncryptionKey PlaintextCyphertext Cleartext K AB

© Copyright Martin Tompa, 1999 What Is a Public Key Cryptosystem? A Sender B Receiver Cryptanalyst (bad guy) C = E AB (M)M = D AB (C)M M C K B E B MessageEncryptionKeyPublic Key PlaintextCyphertextPrivate Key Cleartext K AB

© Copyright Martin Tompa, 1999 The RSA Public Key Cryptosystem v Invented by Rivest, Shamir, and Adleman in v Has proven resistant to all cryptanalytic attacks.

© Copyright Martin Tompa, 1999 Receiver’s Set-Up v Choose 500-digit primes p and q (each 2 more than a multiple of 3). p = 5, q = 11

© Copyright Martin Tompa, 1999 Receiver’s Set-Up v Choose 500-digit primes p and q (each 2 more than a multiple of 3). p = 5, q = 11 v Let n = pq. n = 55

© Copyright Martin Tompa, 1999 Receiver’s Set-Up v Choose 500-digit primes p and q (each 2 more than a multiple of 3). p = 5, q = 11 v Let n = pq. n = 55 v Let s = (1/3) (2(p - 1)(q - 1) + 1). s = (1/3) (2  4  ) = 27

© Copyright Martin Tompa, 1999 Receiver’s Set-Up v Choose 500-digit primes p and q (each 2 more than a multiple of 3). p = 5, q = 11 v Let n = pq. n = 55 v Let s = (1/3) (2(p - 1)(q - 1) + 1). s = (1/3) (2  4  ) = 27 v Publish n. Keep p, q, and s secret.

© Copyright Martin Tompa, 1999 Encrypting a Message v Break the message into chunks. H I C H R I S …

© Copyright Martin Tompa, 1999 Encrypting a Message v Break the message into chunks. H I C H R I S …

© Copyright Martin Tompa, 1999 Encrypting a Message v Break the message into chunks. H I C H R I S … v Translate each chunk into an integer M (0 < M < n) by any convenient method …

© Copyright Martin Tompa, 1999 Encrypting a Message v Break the message into chunks. H I C H R I S … v Translate each chunk into an integer M (0 < M < n) by any convenient method … v Divide M 3 by n. E(M) is the remainder. M = 8, n = = 512 = 9× E(8) = 17

© Copyright Martin Tompa, 1999 Decrypting a Cyphertext C v Divide C s by n. D(C) is the remainder. C = 17, n = 55, s = = 1,667,711,322,168,688,287,513,535,727,415,473 = 30,322,024,039,430,696,136,609,740,498,463 × D(17) = 8

© Copyright Martin Tompa, 1999 Decrypting a Cyphertext C v Divide C s by n. D(C) is the remainder. C = 17, n = 55, s = = 1,667,711,322,168,688,287,513,535,727,415,473 = 30,322,024,039,430,696,136,609,740,498,463 × D(17) = 8 v Translate D(C) into letters. H

© Copyright Martin Tompa, 1999 Why Does It Work? Euler’s Theorem (1736): Suppose v p and q are distinct primes, v n = pq, v 0 < M < n, and v k > 0. If M k(p-1)(q-1)+1 is divided by n, the remainder is M.

© Copyright Martin Tompa, 1999 Why Does It Work? Euler’s Theorem (1736): Suppose v p and q are distinct primes, v n = pq, v 0 < M < n, and v k > 0. If M k(p-1)(q-1)+1 is divided by n, the remainder is M. (M 3 ) s = (M 3 ) (1/3)(2(p-1)(q-1)+1) = M 2(p-1)(q-1)+1

© Copyright Martin Tompa, 1999 Leonhard Euler

© Copyright Martin Tompa, 1999 Why Is It Secure? v To find M = D(C), you seem to need s.

© Copyright Martin Tompa, 1999 Why Is It Secure? v To find M = D(C), you seem to need s. v To find s, you seem to need p and q.

© Copyright Martin Tompa, 1999 Why Is It Secure? v To find M = D(C), you seem to need s. v To find s, you seem to need p and q. v All the cryptanalyst has is n = pq.

© Copyright Martin Tompa, 1999 Why Is It Secure? v To find M = D(C), you seem to need s. v To find s, you seem to need p and q. v All the cryptanalyst has is n = pq. v How hard is it to factor a 1000-digit number n? With the grade school method, doing 1,000,000,000 steps per second it would take …

© Copyright Martin Tompa, 1999 Why Is It Secure? v To find M = D(C), you seem to need s. v To find s, you seem to need p and q. v All the cryptanalyst has is n = pq. v How hard is it to factor a 1000-digit number n? With the grade school method, doing 1,000,000,000 steps per second it would take … years.

© Copyright Martin Tompa, 1999 State of the Art in Factoring v 1977: Inventors encrypt a challenge using “RSA129,” a 129-digit number n = pq. v 1981: Pomerance invents Quadratic Sieve factoring method. v 1994: Using Quadratic Sieve, RSA129 is factored over 8 months using 1000 computers on the Internet around the world. v (1999: Using a new method, RSA140 is factored.)

© Copyright Martin Tompa, 1999 State of the Art in Factoring v 1977: Inventors encrypt a challenge using “RSA129,” a 129-digit number n = pq. v 1981: Pomerance invents Quadratic Sieve factoring method. v 1994: Using Quadratic Sieve, RSA129 is factored over 8 months using 1000 computers on the Internet around the world. v (1999: Using a new method, RSA140 is factored.) v Using Quadratic Sieve, a 250-digit number would take 800,000,000 months instead of 8.

© Copyright Martin Tompa, 1999 Secret Codes, Unforgeable Signatures, and Coin Flipping on the Phone

© Copyright Martin Tompa, 1999 Signed Messages v How A sends a secret message to B A B C = E B (M) M = D B (C) C

© Copyright Martin Tompa, 1999 Signed Messages v How A sends a secret message to B A B C = E B (M) M = D B (C) v How A sends a signed message to B A B C = D A (M) M = E A (C) C C

© Copyright Martin Tompa, 1999 Signed and Secret Messages v How A sends a secret message to B... A B C = E B (M) M = D B (C) v How A sends a signed secret message to B... A B C = E B (D A (M)) M = E A (D B (C)) C C

© Copyright Martin Tompa, 1999 Secret Codes, Unforgeable Signatures, and Coin Flipping on the Phone

© Copyright Martin Tompa, 1999 Flipping a Coin Over the Phone AB Choose random x. y = E A (x) Guess if x is even or odd. Check y = E A (x).  B wins if the guess about x was right, or y = E A (x). y “even” “odd” x