1 / 22

Enhanced Cryptanalysis with Divided Difference for RSA Encryption

Introducing a new attack on RSA encryption, leveraging divided difference tools to enhance cryptanalysis. Explore the computational complexity and efficiency of this special case method. Comparing results with previous techniques. Acknowledging contributions from Peter Montgomery and Gideon Yuval.

reia
Télécharger la présentation

Enhanced Cryptanalysis with Divided Difference for 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. A New Related Message Attack on RSA Oded Yacobi UCSD Yacov Yacobi MSR 4/3/2006

  2. Motivation • A new attack on RSA. • New tools (new in cryptanalysis).

  3. Related Messages

  4. OAEP

  5. OAEP [MG(r)] || [r H(M G(r))]

  6. Previous Result

  7. Our Result

  8. A Special Case

  9. Follow your nose…

  10. Our tool: the divided difference

  11. Example

  12. Adopted lemmas

  13. A new lemma

  14. A new lemma

  15. The attack

  16. Algorithm • Pre-computation • Real-time computation

  17. (Reminder: Adopted lemmas)

  18. More about the computational complexity of the pre-computation

  19. Why is the special case more efficient?

  20. Finite difference continued…

  21. Compare Results

  22. Acknowledgments and References? ACKNOWLEDGEMENTS: Peter Montgomery Gideon Yuval

More Related