1 / 11

Maximizing Security and Efficiency of RSA Encryption

Learn about the Optimal RSA Encryption Scheme developed based on a paper by Mihir Bellare and Phillip Rogaway. Explore the key concepts, encryption and decryption schemes, and the importance of using Optimal RSA for enhanced security and efficiency.

mccallj
Download Presentation

Maximizing Security and Efficiency of RSA Encryption

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Optimal Asymmetric Encryptionbased on a paper by Mihir Bellare and Phillip Rogaway Team Members · Chris Kellogg · Doug Wagers · Angela Johnston · Kris Anupindi

  2. Overview · Introduction · Review RSA · Optimal RSA Encryption Scheme · Run Example Program · Why Should We Use Optimal RSA? · Conclusion

  3. Introduction What is Optimal RSA?

  4. RSA Review Public Key : pair (e, n) Private Key : pair (d, n) Message : M Encryption : Me mod n Decryption : Md mod n

  5. Optimal RSA Encryption Scheme • Terminology • · f : RSA encryption function • · x : binary message of bit length 352 (512-160) • · G() : Generator function (160 bits -> 352 bits) • · H() : Hash function (352 bits -> 160 bits)

  6. Optimal RSA Encryption Scheme • Encryption • 1. r : Pseudo-Random number of bit length 160 • 2. s : x  G(r) (352 bits) • 3. t : r  H(s) (160 bits) • 4. w : s concat t (512 bits) • 5. y : f(w)

  7. Optimal RSA Decryption Scheme Decryption 1. w : f -1 (y) (512 bits) 2. s : the first 352 bits of w 3. t : the last 160 bits of w 4. r : t  H(s) (160 bits) 5. x : s  G(r) (352 bits)

  8. Why should we use Optimal RSA? • Efficiency • · RSA Encryption is the largest factor in • Optimal RSA’s running time. • · The Hash Function, the Generator Function, and • the Pseudo-Random Generator should have a • much lower running time • · Thus, Optimal RSA is basically as efficient as RSA • Security • · The Pseudo-Random generator • increases security • · Every part of w is required to recover • the message

  9. Semantic Security • Must have all of w to recover the message • Must recover everything in a specific order.

  10. Project Demo

  11. Conclusion • Should have “ideal” G & H functions.

More Related