Create Presentation
Download Presentation

Download Presentation

University Of Palestine

Download Presentation
## University Of Palestine

- - - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - - -

**College of Applied**Engineering & Urban Planning Software Engineering Department**The RSA Cryptosystem**1st Term2010/2011**introduction**introduction introduction introduction introduction introduction introduction introduction Click to add Title Click to add Title References References References References References References References References References References References References References Is RSA a One-Way Function? The RSA cryptosystem Conclusion Is RSA a One-Way Function? The RSA cryptosystem Conclusion Is RSA a One-Way Function? The RSA cryptosystem Is RSA a One-Way Function? The RSA cryptosystem Conclusion Is RSA a One-Way Function? Is RSA a One-Way Function? The RSA cryptosystem Is RSA a One-Way Function? Conclusion Conclusion Conclusion The RSA cryptosystem Conclusion Conclusion The RSA cryptosystem Conclusion Is RSA a One-Way Function? Is RSA a One-Way Function? The RSA cryptosystem Conclusion The RSA cryptosystem The RSA cryptosystem Is RSA a One-Way Function? Is RSA a One-Way Function? Is RSA a One-Way Function? The RSA cryptosystem Is RSA a One-Way Function? The RSA cryptosystem The RSA cryptosystem Conclusion Contents Introduction**The RSA cryptosystem**First published: Scientific American, Aug. 1977byRon Rivest & Adi Shamir &Leonard Adelman (after some censorship entanglements) Currently the “work horse” of Internet security: Most Public Key Infrastructure (PKI) products. SSL/TLS: Certificates and key-exchange. Secure e-mail: PGP, Outlook, …**R**p,q n-bit primes, Npq, xZN* R The RSA trapdoor 1-to-1 function • Parameters: N=pq. N 1024 bits. p,q 512 bits. e – encryption exponent. gcd(e, (N) ) = 1 . • 1-to-1 function:RSA(M) = Me (mod N) where MZN* • Trapdoor: d – decryption exponent. Where ed = 1 (mod (N) ) • Inversion:RSA(M)d = Med = Mk(N)+1 =M (mod N) • (n,e,t,)-RSA Assumption: For any t-time alg. A: Pr[ A(N,e,x) = x1/e (N) : ] < **Textbook RSA is insecure**• Textbook RSA encryption: • public key: (N,e) Encrypt: C = Me (mod N) • private key: d Decrypt: Cd = M (mod N) (M ZN*) • Completely insecure cryptosystem: • Does not satisfy basic definitions of security. • Many attacks exist. • The RSA trapdoor permutation is not a cryptosystem !**Randomsession-key K**WebBrowser WebServer CLIENT HELLO d SERVER HELLO (e,N) SERVER HELLO (e,N) C=RSA(K) A simple attack on textbook RSA • Session-key K is 64 bits. View K {0,…,264} Eavesdropper sees: C = Ke (mod N) . • Suppose K = K1K2 where K1, K2 < 234 . (prob. 20%) Then: C/K1e = K2e (mod N) • Build table: C/1e, C/2e, C/3e, …, C/234e . time: 234 For K2 = 0,…, 234 test if K2e is in table. time: 23434 • Attack time: 240 << 264**ciphertext**msg RSA Preprocessing Common RSA encryption • Never use textbook RSA. • RSA in practice: • Main question: • How should the preprocessing be done? • Can we argue about security of resulting system?**16 bits**1024 bits 02 random pad FF msg PKCS1 V1.5 • PKCS1 mode 2: (encryption) • Resulting value is RSA encrypted. • Widely deployed in web servers and browsers. • No security analysis !!**C**C= Is thisPKCS1? Attacker ciphertext WebServer Yes: continue No: error 02 Attack on PKCS1 • Bleichenbacher 98. Chosen-ciphertext attack. • PKCS1 used in SSL: attacker can test if 16 MSBs of plaintext = ’02’. • Attack: to decrypt a given ciphertext C do: • Pick r ZN. Compute C’ = reC = (r PKCS1(M))e. • Send C’ to web server and use response.**M0, M1**M0, M1 Decryption oracle C=E(Mb) bR{0,1} C=E(Mb) bR{0,1} Challenge Challenge C b’{0,1} b’{0,1} Chosen ciphertext security (CCS) • No efficient attacker can win the following game: (with non-negligible advantage) Challenger Attacker Attacker • Attacker wins if b=b’**00..0**01 M rand. H + G + Plaintext to encrypt with RSA PKCS1 V2.0 - OAEP • New preprocessing function: OAEP (BR94). • Thm: RSA is trap-door permutation OAEP is CCS when H,G are “random oracles”. • In practice: use SHA-1 or MD5 for H and G. Check padon decryption.Reject CT if invalid. {0,1}n-1**M**W(M,R) R H + G + M W(M,R) R H + OAEP Improvements • OAEP+: (Shoup’01) trap-door permutation F F-OAEP+ is CCS when H,G,W are “random oracles”. • SAEP+: (B’01) RSA trap-door perm RSA-SAEP+ is CCS when H,W are “random oracle”.**Subtleties in implementing OAEP [M ’00]**OAEP-decrypt(C) { error = 0; if ( RSA-1(C) > 2n-1) { error =1; goto exit; } if ( pad(OAEP-1(RSA-1(C))) != “01000” ) { error = 1; goto exit; } } • Problem: timing information leaks type of error. Attacker can decrypt any ciphertext C. • Lesson: Don’t implement RSA-OAEP yourself …**Is RSA a one-way permutation?**• To invert the RSA one-way function (without d) attacker must compute: M from C = Me (mod N). • How hard is computing e’th roots modulo N ?? • Best known algorithm: • Step 1: factor N. (hard) • Step 2: Find e’th roots modulo p and q. (easy)**Shortcuts?**• Must one factor N in order to compute e’th roots?Exists shortcut for breaking RSA without factoring? • To prove no shortcut exists show a reduction: • Efficient algorithm for e’th roots mod N efficient algorithm for factoring N. • Oldest problem in public key cryptography. • Evidence no reduction exists: (BV’98) • “Algebraic” reduction factoring is easy. • Unlike Diffie-Hellman (Maurer’94).**Improving RSA’s performance**• To speed up RSA decryption use small private key d. Cd = M (mod N) • Wiener87: if d < N0.25 then RSA is insecure. • BD’98: if d < N0.292 then RSA is insecure (open: d < N0.5 ) • Insecure: priv. key d can be found from (N,e). • Small d should never be used.**-** e(N) eN kd kd 1 d(N) 1 2d2 - Wiener’s attack • Recall: ed = 1 (mod (N) ) kZ : ed = k(N) + 1 (N) = N-p-q+1 |N- (N)| p+q 3N d N0.25/3 Continued fraction expansion of e/N gives k/d. ed = 1 (mod k) gcd(d,k)=1**RSA With Low public exponent**• To speed up RSA encryption (and sig. verify) use a small e. C = Me (mod N) • Minimal value: e=3 ( gcd(e, (N) ) = 1) • Recommended value: e=65537=216+1 Encryption: 17 mod. multiplies. • Several weak attacks. Non known on RSA-OAEP. • Asymmetry of RSA: fast enc. / slow dec. • ElGamal: approx. same time for both.**Implementation attacks**• Attack the implementation of RSA. • Timing attack: (Kocher 97) The time it takes to compute Cd (mod N) can expose d. • Power attack: (Kocher 99) The power consumption of a smartcard while it is computing Cd (mod N) can expose d. • Faults attack: (BDL 97) A computer error during Cd (mod N) can expose d. OpenSSL defense: check output. 5% slowdown.**Key lengths**• Security of public key system should be comparable to security of block cipher. NIST: Cipher key-sizeModulus size 64 bits 512 bits. 80 bits 1024 bits 128 bits 3072 bits. 256 bits (AES) 15360 bits • High security very large moduli.Not necessary with Elliptic Curve Cryptography.**References**http://withdotnet.wordpress.com/2009/06/17/cryptography-4-rsa/ http://www.javamex.com/tutorials/cryptography/rsa_encryption.shtml**Thank You !**Done by: Ahmed qeshta Ahmed Alqaramani Supervisor: Eng : Eiman Alajrami