Bibliography
- [NS]Conference
LLL on the Average
pp. 238–256 - [Pro]Preprint
MPFR, a LGPL-library for multiple-precision floating-point computations with exact rounding
http://www.mpfr.org/
- [Sho]Preprint
NTL, Number Theory C++ Library
http://www.shoup.net/ntl/
- [Kne57]Article
Klassenzahlen indefiniter quadratischer Formen in drei oder mehr Veränderlichen
Archiv Math.Vol. 8pp. 241–2501957 - [vEB81]Preprint
Another NP-complete partition problem and the complexity of computing short vectors in a lattice
1981Technical report 81-04, Mathematisch Instituut, Universiteit van Amsterdam
- [LLL82]Article
Factoring polynomials with rational coefficients
Mathematische AnnalenVol. 261pp. 515–5341982 - [FP83]Conference
A procedure for determining algebraic integers of given norm
In EUROCALVol. 162pp. 194–2021983 - [Kan83]Conference
Improved algorithms for integer programming and related lattice problems
In Proceedings of the 15th Symposium on the Theory of Computing (STOC 1983)pp. 99–1081983 - [dW87]Article
Solving exponential Diophantine equations using lattice basis reduction algorithms
J. Number Th.Vol. 26pp. 325–3671987 - [Poh87]Article
A Modification of the LLL Reduction Algorithm
J. Symbolic Comp.Vol. 4(1)pp. 123–1271987 - [SP91]Conference
An algorithm for computing genera of ternary and quaternary quadratic forms
In Proceedings ISSAC'91pp. 134–1431991 - [SE94]Article
Lattice Basis Reduction: Improved Practical Algorithms and Solving Subset Sum Problems
Mathematics of ProgrammingVol. 66pp. 181–1991994 - [SH95]Conference
Attacking the Chor-Rivest Cryptosystem by Improved Lattice Reduction
In Advances in Cryptology---EuroCrypt 1995Vol. 921pp. 1–121995 - [Ajt98]Conference
The Shortest Vector Problem in L2 is NP-hard for Randomized Reductions (Extended Abstract)
In Proceedings of the 30th Symposium on the Theory of Computing (STOC 1998)pp. 10–191998 - [JC98]Book
Sphere Packings, Lattices and Groups
SpringerVol. 2901998 - [Pau98]Conference
Lattice Basis Reduction in Function Fields
In In ANTS-3 : Algorithmicpp. 567–5751998 - [NS01a]Preprint
The Catalogue of Lattices
2001 - [NS01b]Preprint
A Catalogue of Lattices
2001 - [AEVZ02]Article
Closest point search in lattices
IEEE Transactions on Information TheoryVol. 48(8)pp. 2201–22142002 - [Akh02]Article
Random lattices, threshold phenomena and efficient reduction algorithms
Theoretical Computer ScienceVol. 287(2)pp. 359–3852002 - [MG02]Book
Complexity of lattice problems: a cryptographic perspective
Kluwer Academic PublishersVol. 671pp. 2202002 - [Sim05b]Article
Solving quadratic equations using reduced unimodular quadratic forms
Math. Comp.Vol. 74(251)pp. 1531–1543 (electronic)2005 - [HS07]Conference
Improved Analysis of Kannan's Shortest Lattice Vector Algorithm (Extended Abstract)
In Advances in cryptology---CRYPTO 2007Vol. 4622pp. 170–1862007 - [PS08]Conference
Rigorous and efficient short lattice vectors enumeration
In Advances in Cryptology---AsiaCrypt 20082008 - [NS09a]Article
An LLL Algorithm with Quadratic Complexity
SIAM Journal on ComputingVol. 39(3)pp. 874–9032009 - [NS09c]ACM Trans. AlgorithmsVol. 5(4)pp. Art. 46, 482009
- [Ste09]Book Chapter
Floating-point LLL: theoretical and practical aspects
In Proceedings of the LLL+25 conference, held in honour of the 25th anniversary of the LLL algorithm, Caen, France, June 29 - July 1, 2007, Phong Q. Nguyen and Brigitte Vallée (eds)2009To appear