Improved methods for calculating vectors of short length in a lattice, including a complexity analysis

Mathematics of Computation

Volumn 44, Issue 170, 1985, Pages 463-471

  Fincke, U ^a  

^a HEINRICH HEINE UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84966239268     PISSN: 00255718     EISSN: None     Source Type: Journal    
DOI: 10.1090/S0025-5718-1985-0777278-8     Document Type: Article

References (7)

1. U. Dieter, "How to calculate shortest vectors in a lattice, " Math. Comp., 29, 1975, 827-833.
2. U. Fincke M. Pohst, "Some applications of a Cholesky type method in algebraic number theory.
3. U. FINCKE M. POHST, On Reduction Algorithms in Non Linear Integer Mathematical Programming, DGOR Operations Research Proceedings 83, Springer Verlag, Berlin and New York, 1983, 289-295.
4. D. E. Knuth, The Art of Computer Programming, 2, 2nd ed., Addison Wesley. Reading, Mass., 1981, 95-97.
5. A. K. Lenstra, H. W. Lenstra, Jr. L. Lovasz, "Factoring polynomials with rational coefficients, " Math. Ann., 261, 1982, 515-534.
6. A. Odlyzko, Cryptoanalytic attacks on the multiplicative knapsack cryptosystem and on Shamir s fast signature system." Preprint, 1983.
7. M. Pohst, " On the computation of lattice vectors of minimal length, successive minima and reduced bases with applications, " ACM SIGSAM Bull., 15, 1981, 37-44.