Public Key Encryption Engineering & Analysis Operation-Part2

Slides:



Advertisements
Similar presentations
RSA.
Advertisements

CSE331: Introduction to Networks and Security Lecture 19 Fall 2002.
Data encryption with big prime numbers
22C:19 Discrete Structures Integers and Modular Arithmetic
hap8.html#chap8ex5.
22C:19 Discrete Math Integers and Modular Arithmetic Fall 2010 Sukumar Ghosh.
Lecture 3.3: Public Key Cryptography III CS 436/636/736 Spring 2012 Nitesh Saxena.
Great Theoretical Ideas in Computer Science.
Foundations of Network and Computer Security J J ohn Black Lecture #10 Sep 18 th 2009 CSCI 6268/TLEN 5550, Fall 2009.
The RSA Cryptosystem and Factoring Integers (II) Rong-Jaye Chen.
CS470, A.SelcukPublic Key Cryptography1 CS 470 Introduction to Applied Cryptography Instructor: Ali Aydin Selcuk.
RSA Exponentiation cipher
Cryptography & Number Theory
CSE 321 Discrete Structures Winter 2008 Lecture 8 Number Theory: Modular Arithmetic.
Tallinn University of Technology Quantum computer impact on public key cryptography Roman Stepanenko.
Codes, Ciphers, and Cryptography-RSA Encryption
Lecture 6: Public Key Cryptography
Lecture 7b: The Diffie-Hellman Secret Sharing Scheme Wayne Patterson SYCS 653 Fall 2009.
Copyright © Cengage Learning. All rights reserved.
RSA and its Mathematics Behind
Great Theoretical Ideas in Computer Science.
RSA Ramki Thurimella.
The Complexity of Primality Testing. What is Primality Testing? Testing whether an integer is prime or not. – An integer p is prime if the only integers.
Implementing RSA Encryption in Java
Modular Arithmetic with Applications to Cryptography Lecture 47 Section 10.4 Wed, Apr 13, 2005.
RSA Slides by Kent Seamons and Tim van der Horst Last Updated: Oct 1, 2013.
Algebra of RSA codes Yinduo Ma Tong Li. Ron Rivest, Adi Shamir and Leonard Adleman.
RSA and its Mathematics Behind July Topics  Modular Arithmetic  Greatest Common Divisor  Euler’s Identity  RSA algorithm  Security in RSA.
22C:19 Discrete Structures Integers and Modular Arithmetic Fall 2014 Sukumar Ghosh.
Scott CH Huang COM 5336 Cryptography Lecture 6 Public Key Cryptography & RSA Scott CH Huang COM 5336 Cryptography Lecture 6.
Public Key Cryptosystems RSA Diffie-Hellman Department of Computer Engineering Sharif University of Technology 3/8/2006.
Lecture 6.1: Misc. Topics: Number Theory CS 250, Discrete Structures, Fall 2011 Nitesh Saxena.
James C. Bradas, Ph.D. Engineering & Analysis Operation 18 June 2009 Public Key Encryption.
ENCRYPTION TAKE 2: PRACTICAL DETAILS David Kauchak CS52 – Spring 2015.
1 Section Congruences In short, a congruence relation is an equivalence relation on the carrier of an algebra such that the operations of the algebra.
Secret Codes, Unforgeable Signatures, and Coin Flipping on the Phone Martin Tompa Computer Science & Engineering University of Washington.
Introduction to Cryptography Lecture 9. Public – Key Cryptosystems Each participant has a public key and a private key. It should be infeasible to determine.
Week 4 - Wednesday.  What did we talk about last time?  Finished DES  AES.
Introduction to Number Theory
Introduction to Elliptic Curve Cryptography CSCI 5857: Encoding and Encryption.
RSA Pubic Key Encryption CSCI 5857: Encoding and Encryption.
Data encryption with big prime numbers DANIEL FREEMAN, SLU.
Lecture 5 Asymmetric Cryptography. Private-Key Cryptography Traditional private/secret/single key cryptography uses one key Shared by both sender and.
What is the Smallest RSA Private Key Why is there, at all, such a thing? Why is it not 42? Why is the smallest public key not 35? Or,
Revision. Cryptography depends on some properties of prime numbers. One of these is that it is rather easy to generate large prime numbers, but much harder.
Encryption Take 2: Practical details
Public Key Cryptography
Public Key Encryption Major topics The RSA scheme was devised in 1978
Practical Aspects of Modern Cryptography
Mathematics of Cryptography
Visit for more Learning Resources
Chapter Applications of Number Theory Some Useful Results
RSA Slides by Kent Seamons and Tim van der Horst
Lecture 5 RSA DR. Nermin Hamza.
CS 2210:0001Discrete Structures Modular Arithmetic and Cryptography
RSA and El Gamal Cryptosystems
Public-key Cryptography
The RSA Algorithm JooSeok Song Tue.
Private-Key Cryptography
CS/COE 1501 Recitation RSA Encryption/Decryption
Mathematical Background: Prime Numbers
Number Theory and Euclidean Algorithm
Prime and Relatively Prime Numbers
Foundations of Network and Computer Security
Classical Ciphers – 2 CSCI284 Spring 2004 GWU
Public Key Cryptography
CSE 321 Discrete Structures
Digital Signatures…!.
Lecture 3.1: Public Key Cryptography I
Presentation transcript:

Public Key Encryption Engineering & Analysis Operation-Part2 James C. Bradas, Ph.D. 18 June 2009

Let’s Try An Example to See How This Works RSA Public Key Encryption Scheme Alice 1. Select two large prime numbers, p & q 2. Compute their product – the “modulus” n: 3. Compute the “totient” F Public Key 4. Choose e, 1 < e < F such that greatest common divisor (gcd) ( e , F ) = 1 e is the “public key exponent” ( Common choices are e = 3, 17 & 65537 ) Private Key ( n , e ) Public Key 5. Compute d such that ( n , d ) Private Key

Let’s Try An Example to See How This Works RSA Public Key Encryption Scheme Alice 1. Select two large prime numbers, p & q 2. Compute their product – the “modulus” n: 3. Compute the “totient” F Public Key 4. Choose e, 1 < e < F such that greatest common divisor (gcd) ( e , F ) = 1 e is the “public key exponent” ( Common choices are e = 3, 17 & 65537 ) Private Key ( n , e ) Public Key 5. Compute d such that ( n , d ) Private Key For this example, we’ll use small prime numbers – the principal is exactly the same….

Let’s Try An Example to See How This Works RSA Public Key Encryption Scheme Alice let p = 11, q = 3 1. Select two large prime numbers, p & q 2. Compute their product – the “modulus” n: 3. Compute the “totient” F Public Key 4. Choose e, 1 < e < F such that greatest common divisor (gcd) ( e , F ) = 1 e is the “public key exponent” ( Common choices are e = 3, 17 & 65537 ) Private Key ( n , e ) Public Key 5. Compute d such that ( n , d ) Private Key

Let’s Try An Example to See How This Works RSA Public Key Encryption Scheme Alice let p = 11, q = 3 n = 11 x 3 = 33 1. Select two large prime numbers, p & q 2. Compute their product – the “modulus” n: 3. Compute the “totient” F Public Key 4. Choose e, 1 < e < F such that greatest common divisor (gcd) ( e , F ) = 1 e is the “public key exponent” ( Common choices are e = 3, 17 & 65537 ) Private Key ( 33 , e ) Public Key 5. Compute d such that ( 33 , d ) Private Key

Let’s Try An Example to See How This Works RSA Public Key Encryption Scheme Alice let p = 11, q = 3 n = 11 x 3 = 33 1. Select two large prime numbers, p & q 2. Compute their product – the “modulus” n: 3. Compute the “totient” F Public Key 4. Choose e, 1 < e < F such that greatest common divisor (gcd) ( e , F ) = 1 e is the “public key exponent” ( Common choices are e = 3, 17 & 65537 ) Private Key ( 33 , e ) Public Key 5. Compute d such that ( 33 , d ) Private Key

Let’s Try An Example to See How This Works RSA Public Key Encryption Scheme Alice let p = 11, q = 3 n = 11 x 3 = 33 1. Select two large prime numbers, p & q 2. Compute their product – the “modulus” n: 3. Compute the “totient” F Public Key 4. Choose e, 1 < e < F such that greatest common divisor (gcd) ( e , F ) = 1 e is the “public key exponent” ( Common choices are e = 3, 17 & 65537 ) Private Key ( 33 , 3 ) Public Key 5. Compute d such that ( 33 , d ) Private Key

Let’s Try An Example to See How This Works RSA Public Key Encryption Scheme Alice let p = 11, q = 3 n = 11 x 3 = 33 1. Select two large prime numbers, p & q 2. Compute their product – the “modulus” n: 3. Compute the “totient” F Public Key 4. Choose e, 1 < e < F such that greatest common divisor (gcd) ( e , F ) = 1 e is the “public key exponent” ( Common choices are e = 3, 17 & 65537 ) Private Key ( 33 , 3 ) Public Key 5. Compute d such that ( 33 , d ) Private Key Check

Let’s Try An Example to See How This Works RSA Public Key Encryption Scheme Alice let p = 11, q = 3 n = 11 x 3 = 33 1. Select two large prime numbers, p & q 2. Compute their product – the “modulus” n: 3. Compute the “totient” F Public Key 4. Choose e, 1 < e < F such that greatest common divisor (gcd) ( e , F ) = 1 e is the “public key exponent” ( Common choices are e = 3, 17 & 65537 ) Private Key ( 33 , 3 ) Public Key 5. Compute d such that ( 33 , 7 ) Private Key Check

Let’s Try An Example to See How This Works RSA Public Key Encryption Scheme Alice let p = 11, q = 3 n = 11 x 3 = 33 1. Select two large prime numbers, p & q 2. Compute their product – the “modulus” n: 3. Compute the “totient” F Public Key 4. Choose e, 1 < e < F such that greatest common divisor (gcd) ( e , F ) = 1 e is the “public key exponent” ( Common choices are e = 3, 17 & 65537 ) Private Key ( 33 , 3 ) Public Key 5. Compute d such that ( 33 , 7 ) Private Key Check

Suppose Bob Wants to Send Alice the Letter “Z” Let’s say that in the agreed-upon reversible padding scheme, “Z” equals the number 7. Therefore, we want to encrypt m = 7 n e ( 33 , 3 ) Public Key Recall is a solution to

So…. Check

After Computing Alice Bob “Z” Bob sends c = 13 to Alice

Alice Receives “13” Alice Bob ( 33 , 7 ) Private Key n d

Reversible Padding Scheme Alice Receives “13” Alice Bob ( 33 , 7 ) Private Key n d Reversible Padding Scheme

“Z” Alice Bob ( 33 , 7 ) Private Key n d Reversible Padding Scheme “Z”

How does this Work? So What’s Going On Here? M m Encrypt Alice Bob Bob’s Message Public Key Private Key Decrypt How does this Work?

Some more properties we need to know If and Then let

… and more properties or Fermat’s Little Theorem: If p is a prime number, then for ANY integer a, will be evenly divisible by p. or Euler’s Theorem (An Extension of Fermat’s Little Theorem) gcd(a,n)=1 Φ(n) = (p-1)(q-1) is Euler’s “Totient”

Here’s What I Want to Prove Given: 1. 2. 3. If: I can recover m via Then:

Here’s The Details Start With: Let’s raise c to the d power and use

Here’s The Details

Here’s The Details

Here’s The Details

Here’s The Details Now, recall that Euler’s Theorem

Here’s The Details (cont’d)

Here’s The Details (cont’d) Which Can Be Written

Here’s The Details (cont’d) Which is What I Wanted to Prove

Here’s The Details (cont’d) Which is What I Wanted to Prove This is because: Except for the change in sign, the two terms are equivalent.

So, Where Does RSA Encryption Stand? For now, RSA PKE is still secure In 1991, RSA Laboratories published 54 large semiprimes (numbers with exactly two prime factors) and issued cash prizes for successful factorization. According to Wikepedia, 12 of the 54 listed numbers had been factored by March 2008 The RSA challenge officially ended in 2007 Fastest Published Integer Factorization Algorithms: General Number Field Sieve Quadratic Sieve Development of a large Q-Bit Quantum Computer MIGHT make RSA vulnerable, although this is not certain Fundamental breakthroughs in Number Theory (such as solving the Riemann Hypothesis) still required before RSA becomes vulnerable

"The whole of e-commerce depends on prime numbers "The whole of e-commerce depends on prime numbers. I have described the primes as atoms: what mathematicians are missing is a kind of mathematical prime spectrometer. Chemists have a machine that, if you give it a molecule, will tell you the atoms that it is built from. Mathematicians haven't invented a mathematical version of this. That is what we are after. If the Riemann hypothesis is true, it won't produce a prime number spectrometer. But the proof should give us more understanding of how the primes work, and therefore the proof might be translated into something that might produce this prime spectrometer. If it does, it will bring the whole of e-commerce to its knees, overnight. So there are very big implications." - Marcus du Sautoy (“The Music of the Primes”)

Questions