Analysis of the Ideal-SIVP to Ring-DLWE Security Reduction
Analysis of the Ideal-SIVP to Ring-DLWE Security Reduction
This talk, which will describe several deficiencies from a practice-oriented viewpoint in the approximate ideal-SIVP to ring-DLWE reduction, is based on the following work: N. Koblitz, S. Samajder, P. Sarkar, and S. Singha, Concrete Analysis of Approximate Ideal-SIVP to Decision Ring-LWE Reduction, eprint.iacr.org/2022/275.pdf
About the speaker
Professor, University of Washington
Neal Koblitz received his PhD in mathematics from Princeton in 1974, and since 1979 has been at the University of Washington in Seattle. He is co-inventor of Elliptic Curve Cryptography, for which he received the RSA Award for Excellence in Mathematics (2009), the Information Systems Security Association Hall of Fame (Class of 2019), the Eduard Rhein Foundation Technology Award (2020), and the Levchin Prize in Real World Cryptography (2021). In recent years most of his research has been devoted to analyzing and critiquing claims of provable security.
Monash University values the privacy of every individual's personal information and is committed to the protection of that information from unauthorised use and disclosure except where permitted by law. For information about the handling of your personal information please see Data Protection and Privacy Procedure and the relevant Data Protection and Privacy Collection Statement that applies to you depending on the nature of your interaction with us.
If you have any questions about how Monash University is collecting and handling your personal information, please contact our Data Protection and Privacy Office at dataprotectionofficer@monash.edu.