New lattice based cryptographic constructions

We introduce the use of Fourier analysis on lattices as an integral part of a lattice based construction. The tools we develop provide an elegant description of certain Gaussian distributions around lattice points. Our results include two cryptographic constructions that are based on the worst-case hardness of the unique shortest vector problem. The main result is a new public key cryptosystem whose security guarantee is considerably stronger than previous results

• Type: Conference
• Year: 2003
• Where: STOC
• Authors: Oded Regev
• Keywords: Algorithms, Certain Gaussian Distributions, Lattice Based Construction, Shortest Vector Problem, STOC 2003