Paper 2015/1014
Fast Fourier Orthogonalization
Léo Ducas and Thomas Prest
Abstract
The classical fast Fourier transform (FFT) allows to compute in quasi-linear time the product of two polynomials, in the {\em circular convolution ring}
Metadata
- Available format(s)
-
PDF
- Category
- Public-key cryptography
- Publication info
- Preprint. MINOR revision.
- Keywords
- Fast Fourier TransformGram-Schmidt OrthogonalizationNearest Plane AlgorithmLattice AlgorithmsLattice Trapdoor Functions.
- Contact author(s)
- thomas prest @ ens fr
- History
- 2016-05-04: last of 3 revisions
- 2015-10-19: received
- See all versions
- Short URL
- https://ia.cr/2015/1014
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2015/1014, author = {Léo Ducas and Thomas Prest}, title = {Fast Fourier Orthogonalization}, howpublished = {Cryptology {ePrint} Archive, Paper 2015/1014}, year = {2015}, url = {https://eprint.iacr.org/2015/1014} }