Paper 2013/039

Creating a Challenge for Ideal Lattices

Thomas Plantard and Michael Schneider


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. In order to prove or disprove this assumption, we instantiate random ideal lattices that allow to test algorithms that solve SVP and its approximate version. The Ideal Lattice Challenge allows online submission of short vectors to enter a hall of fame for full comparison. We adjoin a set of first experiments and a first comparison of ideal and regular lattices.

Available format(s)
Publication info
Published elsewhere. Unknown where it was published
Lattice-Based CryptographyIdeal LatticesCyclotomic RingsLattice Challenge
Contact author(s)
mischnei @ cdc informatik tu-darmstadt de
2013-01-29: received
Short URL
Creative Commons Attribution


      author = {Thomas Plantard and Michael Schneider},
      title = {Creating a Challenge for Ideal Lattices},
      howpublished = {Cryptology ePrint Archive, Paper 2013/039},
      year = {2013},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.