A Creative Way of Breaking RSA Azeem Jiva. Overview ● What is RSA? – Public Key Algorithm – Is it secure? ● Ways to break RSA – Discover the Public Key.

Slides:



Advertisements
Similar presentations
RSA and Public Key Cryptography Oct Nathanael Paul.
Advertisements

Number Theory Algorithms and Cryptography Algorithms Prepared by John Reif, Ph.D. Analysis of Algorithms.
Public Key Encryption Algorithm
22C:19 Discrete Math Integers and Modular Arithmetic Fall 2010 Sukumar Ghosh.
Computer Science CSC 405By Dr. Peng Ning1 CSC 405 Introduction to Computer Security Topic 2. Basic Cryptography (Part II)
Notation Intro. Number Theory Online Cryptography Course Dan Boneh
Foundations of Network and Computer Security J J ohn Black Lecture #7 Sep 14 th 2004 CSCI 6268/TLEN 5831, Fall 2004.
RSA ( Rivest, Shamir, Adleman) Public Key Cryptosystem
The RSA Cryptosystem and Factoring Integers (II) Rong-Jaye Chen.
Foundations of Network and Computer Security J J ohn Black Lecture #12 Sep 23 rd 2009 CSCI 6268/TLEN 5550, Fall 2009.
Foundations of Network and Computer Security J J ohn Black Lecture #10 Sep 29 th 2005 CSCI 6268/TLEN 5831, Fall 2005.
Public Key Cryptography
Cryptography & Number Theory
Cryptography1 CPSC 3730 Cryptography Chapter 9 Public Key Cryptography and RSA.
Foundations of Network and Computer Security J J ohn Black Lecture #12 Sep 24 th 2007 CSCI 6268/TLEN 5831, Fall 2007.
Chapter 3 Encryption Algorithms & Systems (Part B)
Public Key Algorithms 4/17/2017 M. Chatterjee.
Tallinn University of Technology Quantum computer impact on public key cryptography Roman Stepanenko.
Codes, Ciphers, and Cryptography-RSA Encryption
Asymmetric encryption. Asymmetric encryption, often called "public key" encryption, allows Alice to send Bob an encrypted message without a shared secret.
Public Key Model 8. Cryptography part 2.
 Introduction  Requirements for RSA  Ingredients for RSA  RSA Algorithm  RSA Example  Problems on RSA.
Dan Boneh Intro. Number Theory Intractable problems Online Cryptography Course Dan Boneh.
Foundations of Network and Computer Security J J ohn Black Lecture #14 Oct 1 st 2007 CSCI 6268/TLEN 5831, Fall 2007.
May 29, 2008 GNFS polynomials Peter L. Montgomery Microsoft Research, USA 1 Abstract The Number Field Sieve is asymptotically the fastest known algorithm.
1 AN EFFICIENT METHOD FOR FACTORING RABIN SCHEME SATTAR J ABOUD 1, 2 MAMOUN S. AL RABABAA and MOHAMMAD A AL-FAYOUMI 1 1 Middle East University for Graduate.
Information Security and Management 4. Finite Fields 8
RSA and its Mathematics Behind
Copyright, Yogesh Malhotra, PhD, 2013www.yogeshmalhotra.com SPECIAL PURPOSE FACTORING ALGORITHMS Special Purpose Factoring Algorithms For special class.
Cryptography: RSA & DES Marcia Noel Ken Roe Jaime Buccheri.
Fall 2008CS 334: Computer Security1 Public Key Cryptography.
1 Lecture 9 Public Key Cryptography Public Key Algorithms CIS CIS 5357 Network Security.
Public-Key Cryptography CS110 Fall Conventional Encryption.
Digital Signatures A primer 1. Why public key cryptography? With secret key algorithms Number of key pairs to be generated is extremely large If there.
Improving Encryption Algorithms Betty Huang Computer Systems Lab
Factorization of a 768-bit RSA modulus Jung Daejin Lee Sangho.
Strength of Cryptographic Systems Dr. C F Chong, Dr. K P Chow Department of Computer Science and Information Systems The University of Hong Kong.
Private-Key Cryptography  traditional private/secret/single key cryptography uses one key  shared by both sender and receiver  if this key is disclosed.
CSCE 715: Network Systems Security Chin-Tser Huang University of South Carolina.
Public Key Cryptography. symmetric key crypto requires sender, receiver know shared secret key Q: how to agree on key in first place (particularly if.
1 Public-Key Cryptography and Message Authentication.
What is RSA RSA is a system employed to create the encrypted message in which the key used for encryption is different from that used to decrypt. It is.
RSA Prepared by: SITI ZAINAH ADNAN
Presented by Katherine Heller COSC 4765 University of Wyoming April 26, 2011 Image source: PC Dynamics, Inc.
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.
CSCE 715: Network Systems Security Chin-Tser Huang University of South Carolina.
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.
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.
Fall 2002CS 395: Computer Security1 Chapter 9: Public Key Cryptography.
CS Modular Division and RSA1 RSA Public Key Encryption To do RSA we need fast Modular Exponentiation and Primality generation which we have shown.
CS 4803 Fall 04 Public Key Algorithms. Modular Arithmetic n Public key algorithms are based on modular arithmetic. n Modular addition. n Modular multiplication.
Week 4 - Wednesday.  What did we talk about last time?  Finished DES  AES.
ECE Prof. John A. Copeland fax Office: GCATT Bldg.
Introduction to Elliptic Curve Cryptography CSCI 5857: Encoding and Encryption.
Chapter 9 – Public Key Cryptography and RSA Every Egyptian received two names, which were known respectively as the true name and the good name, or the.
CSCE 715: Network Systems Security Chin-Tser Huang University of South Carolina.
Lecture 6. RSA Use in Encryption to encrypt a message M the sender: – obtains public key of recipient PU={e,n} – computes: C = M e mod n, where 0≤M
Information and Computer Security CPIS 312 Lab 8 1 Asymmetric Key Algorithms RSA Algorithm TRIGUI Mohamed Salim.
1 Introduction to Information Security , Spring 2016 Lecture 4: Applied cryptography: asymmetric Zvi Ostfeld Slides credit: Eran Tromer.
Copyright © Zeph Grunschlag, RSA Encryption Zeph Grunschlag.
Cryptography Deffie hellman. organization Foundations Symmetric key Symmetric key weaknesses Assymmetric key Deffie hellman – key exchange RSA – public.
Key Exchange in Systems VPN usually has two phases –Handshake protocol: key exchange between parties sets symmetric keys –Traffic protocol: communication.
Public Key Cryptography
Analysis of the RSA Encryption Algorithm
Chapter 3 - Public-Key Cryptography & Authentication
Mathematical Background for Cryptography
Presentation transcript:

A Creative Way of Breaking RSA Azeem Jiva

Overview ● What is RSA? – Public Key Algorithm – Is it secure? ● Ways to break RSA – Discover the Public Key – Number Field Sieve

What is RSA? ● RSA is named after its Inventors ● Public Key Algorithm ● Variable Key Length – 512bits, 1024bits are most common – 2048bits, 4096bits are extreme ● Variable Plaintext Length ● Ciphertext Length same as Key Length ● RSA is slow, used mostly to encrypt second key

Definitions ● Relative Prime – No common divisors except for 1 – Sometimes called Coprime and Strangers [2] – e.g. 3 and 5 ● Multiplicative Inverse – Number which multiplied by another number gives you one [3]

How RSA Works ● Need Public and Private Key – Don't tell anyone the Private Key! ● To create Public Key need two large primes – P and Q; 256bits each – Multiply them together, result is N – ø(N)=(P-1)(Q-1) – Find E relative prime to ø(N) – Public Key is (E,N)

Private Key and Encryption ● Need to find multiplicative inverse of: – D = E mod ø(N) ● Private Key is (D, N) ● Now you can encrypt – Ciphertext c = M E mod N ● And decrypt – M = C D mod N ● And sign messages – S = M D mod N

Is RSA Secure? ● Fundamental Tenent of Cryptography ● Difficult to factor, but there are other ways – “Wait”/”Attack” ● RSA-155 (512bits) was broken in 7 months [1] – Took 8700 MIPS years ● Estimated time till factored [1] – 768bits – 2010 – 1024bits – 2018

Breaking RSA ● Quadratic Sieve – Previous way ● Number Field Sieve – Currently the fastest way – O{exp[c(log n) 1/3 (log log n) 2/3 ]} – Can be parallelized on multiple machines – Interesting work by Dan Bernstein ●

Number Field Sieve ● Four main steps – Polynomial Selection – Sieving – Linear Algebra – Square Root ● The Sieving is the most time consuming

Polynomial Selection ● Select two irreducible polynomials (Primes) – F 1 (x) – F 2 (x) ● They have a common root – M mod N

Sieving ● Finds two numbers that are relatively prime – GCD(a,b) = 1 ● Both numbers are smooth over factor bases – B deg(f1) f 1 (a/b) – B deg(f2) f 2 (a/b) ● These two numbers are “relations” ● Find as many of these “relations” so that several subsets S with property X 2 ≡ Y 2 (mod n) can be found

Linear Algebra ● Filters the results from Sieving – Remove duplicates – Remove relations that do not occur anywhere else – Certain relations are merged ● Eliminate primes and prime ideals which occur exactly k times in k situations – Use a Lanczos Algorithm ● Most time consuming of Linear Algebra Step

Square Root ● Computes Square Roots – a is the root of a polynomial f 1 (x), f 2 (x) – a – ba have smooth norms – Cardinality of S is in the millions

Projects ● NFS Net – ● Lattice Siever –

Factoring Records

References ● Factorization of a 512-bit Modulus, Cavallar, etc ● mathworld.wolfram.com/RelativelyPrime.html ● ●