Events by date

Title: Are cryptosystems based on ideal lattices quantum-safe ?

Speaker Jean-Francois Biasse Affiliation: University of South Florida Room:  QNC 1501

Abstract:

Shor's algorithm factors RSA integers and solves the Discrete Logarithm Problem (DLP) in quantum polynomial time. Therefore, alternatives to these cryptosystems must be developed to replace the current cryptographic schemes. One of the most interesting family of schemes that have been proposed for the replacement of RSA-based and DLP-based primitives relies on the hardness of finding short vectors in Euclidean lattices.