On the Shortness of Vectors to Be Found by the Ideal-SVP Quantum Algorithm
Authors:
- Léo DucasLDLéo Ducas
- Maxime PlançonMPMaxime Plançon
- Benjamin WesolowskiBWBenjamin Wesolowski
- 1 August 2019
- book chapter
- Published by Springer Nature
- p. 322-351
Abstract
No abstract availableThis publication has 34 references indexed in Scilit:
- On lattices, learning with errors, random linear codes, and cryptographyJournal of the ACM, 2009
- Class numbers of real cyclotomic fields of prime conductorMathematics of Computation, 2002
- Minus class groups of the fields of the 𝑙-th roots of unityMathematics of Computation, 1998
- NTRU: A ring-based public key cryptosystem1998
- On Lovász’ lattice reduction and the nearest lattice point problemCombinatorica, 1986
- Factoring polynomials with rational coefficientsMathematische Annalen, 1982
- On the Stickelberger ideal and the circular units of an abelian fieldInventiones Mathematicae, 1980
- Euclid's Algorithm in Cyclotomic FieldsJournal of the London Mathematical Society, 1975
- The Class Number of the Cyclotomic FieldProceedings of the National Academy of Sciences, 1949
- Über Dirichletsche Reihen mit komplexen Charakteren.Journal für die reine und angewandte Mathematik (Crelles Journal), 1927