User:Ppol10/sandbox
Appearance
This user page or section is in a state of significant expansion or restructuring. You are welcome to assist in its construction by editing it as well. If this user page has not been edited in several days, please remove this template. If you are the editor who added this template and you are actively editing, please be sure to replace this template with {{in use}} during the active editing session. Click on the link for template parameters to use.
This page was last edited by Ppol10 (talk | contribs) 13 years ago. (Update timer) |
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]
- ^ Eva Bayer-Fluckiger. Ideal Lattices . In A panorama in number theory, or, The view from Baker's garden, 2002.
- ^ 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.
- ^ 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.