Creating a Challenge for Ideal Lattices

Download Now
Provided by: University of Wisconsin–River Falls
Topic: Security
Format: PDF
Lattice-based cryptography is one of the candidates in the area of post-quantum cryptography. Cryptographic schemes with security reductions to hard lattice problems (like the Shortest Vector Problem SVP) offer an alternative to recent number theory-based schemes. In order to guarantee asymptotic efficiency, most lattice-based schemes are instantiated using polynomial rings over integers. These lattices are called ideal lattices. It is assumed that the hardness of lattice problems in lattices over integer rings remains the same as in regular lattices.
Download Now

Find By Topic