Jump to content

User:Ppol10/sandbox

From Wikipedia, the free encyclopedia

2nd Definition[1]
An ideal lattice is a lattice , where is a (fractional) -ideal and is such that



for all and for all .


As a -module, is isomorphic to regardless of the choice of .

For simplicity, some studies only concentrate on rings of the form , as they have proved to be the most useful for practical applications [2].


text[3]


  1. ^ Eva Bayer-Fluckiger. Ideal Lattices . In A panorama in number theory, or, The view from Baker's garden, 2002.
  2. ^ Lyubashevsky, V., Micciancio, D., Peikert, C., Rosen, A. SWIFFT: A modest proposal for FFT hashing . In Fast Software Encryption (FSE) (2008); Preliminary version appeared at the 2nd NIST Cryptographic Hash Function Workshop, 2008.
  3. ^ Craig Gentry, Chris Peikert and Vinod Vaikuntanathan. Trapdoors for hard lattices and new cryptographic constructions. In Proceedings of the 40th annual ACM symposium on Theory of computing, 2008.