Bibliography
- [AEVZ02]Article
Closest point search in lattices.
IEEE Transactions on Information Theory, 48(8):2201–2214, 2002. - [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), pages 10–19. ACM, 1998. - [Akh02]Article
Random lattices, threshold phenomena and efficient reduction algorithms.
Theoretical Computer Science, 287(2):359–385, 2002. - [CS98]Book
Sphere Packings, Lattices and Groups, volume 290 of Grundlehren der Mathematischen Wissenschaften.
Springer, New York–Berlin–Heidelberg, 3rd edition, 1998. - [dW87]Article
Solving exponential Diophantine equations using lattice basis reduction algorithms.
J. Number Th., 26:325–367, 1987. - [FP83]Conference
A procedure for determining algebraic integers of given norm.
In EUROCAL, volume 162 of LNCS, pages 194–202. Springer, 1983. - [HPP06]Conference
ANTS VII, volume 4076 of LNCS. Springer-Verlag, 2006.
- [HS07]Conference
Improved Analysis of Kannan's Shortest Lattice Vector Algorithm (Extended Abstract).
In Advances in cryptology—CRYPTO 2007, volume 4622 of LNCS, pages 170–186. Springer, 2007. - [Kan83]Conference
Improved algorithms for integer programming and related lattice problems.
In Proceedings of the 15th Symposium on the Theory of Computing (STOC 1983), pages 99–108. ACM, 1983. - [Kne57]Article
Klassenzahlen indefiniter quadratischer Formen in drei oder mehr Veränderlichen.
Archiv Math., 8:241–250, 1957. - [LLL82]Article
Factoring polynomials with rational coefficients.
Mathematische Annalen, 261:515–534, 1982. - [MG02]Book
Complexity of lattice problems: a cryptographic perspective, volume 671 of The Kluwer International Series in Engineering and Computer Science.
Kluwer Academic Publishers, 2002.220 pages, ISBN 0-7923-7688-9. - [NS01a]Preprint
The Catalogue of Lattices.
http://www.research.att.com/~njas/lattices/, 2001. - [NS01b]Preprint
A Catalogue of Lattices.
http://akpublic.research.att.com/~njas/lattices/index.html, 2001.Cited in 1 page
- [NS06b]Conference
LLL on the Average.
In Hess et al. [HPP06], pages 238–256. - [NS09a]Article
An LLL Algorithm with Quadratic Complexity.
SIAM Journal on Computing, 39(3):874–903, 2009. - [NS09c]ACM Trans. Algorithms, 5(4):Art. 46, 48, 2009.
- [Pau98]Conference
Lattice Basis Reduction in Function Fields.
In In ANTS-3 : Algorithmic, pages 567–575. Springer-Verlag, 1998. - [Poh87]Article
A Modification of the LLL Reduction Algorithm.
J. Symbolic Comp., 4(1):123–127, 1987. - [Pro]Preprint
MPFR, a LGPL-library for multiple-precision floating-point computations with exact rounding.
http://www.mpfr.org/. - [PS08]Conference
Rigorous and efficient short lattice vectors enumeration.
In Advances in Cryptology—AsiaCrypt 2008, LNCS. Springer, 2008. - [SE94]Article
Lattice Basis Reduction: Improved Practical Algorithms and Solving Subset Sum Problems.
Mathematics of Programming, 66:181–199, 1994.Cited in 2 pages
- [SH95]Conference
Attacking the Chor-Rivest Cryptosystem by Improved Lattice Reduction.
In Advances in Cryptology—EuroCrypt 1995, volume 921 of LNCS, pages 1–12. Springer-Verlag, 1995. - [Sho]Preprint
NTL, Number Theory C++ Library.
http://www.shoup.net/ntl/. - [Sim05b]Article
Solving quadratic equations using reduced unimodular quadratic forms.
Math. Comp., 74(251):1531–1543 (electronic), 2005. - [SP91]Conference
An algorithm for computing genera of ternary and quaternary quadratic forms.
In S. M. Watt, editor, Proceedings ISSAC'91, pages 134–143, Bonn, 1991.Cited in 1 page
- [Ste09]Book Chapter
Floating-point LLL: theoretical and practical aspects.
In P. Q. Nguyen and B. Vallée, editors, The LLL Algorithm, Information Security and Cryptography, pages 179–213. Springer-Verlag, 2009. - [vEB81]Preprint
Another NP-complete partition problem and the complexity of computing short vectors in a lattice.
Technical report 81-04, Mathematisch Instituut, Universiteit van Amsterdam, 1981.