A Note on Integer Factorization Using Lattices

A procedure for determining algebraic integers of given norm

Fincke, U., and Pohst, M · 1983

Earlier work this paper cites.

Improved algorithms for integer programming and related lattice problems

Kannan, R · 1983

Earlier work this paper cites.

Solving exponential diophantine equations using lattice basis reduction algorithms

De Weger, B · 1987

Earlier work this paper cites.

Lectures on the Geometry of Numbers

Siegel, C. L · 1989

Earlier work this paper cites.

Factoring integers and computing discrete logarithms via diophantine approximation

Schnorr, C. P · 1993

Cited alongside, same era.

Factoring and lattice reduction

Adleman, L. M · 1995

Cited alongside, same era.

Factoring via strong lattice reduction algorithms

Ritter, H., and Rössner, C · 1997

Cited alongside, same era.

Finding the closest lattice vector when it’s unusually close

Klein, P. N · 2000

Cited alongside, same era.

The matrix reference manual

Brookes, M

Cited in the paper.

Complexity of Lattice Problems: a cryptographic perspective

Micciancio, D., and Goldwasser, S · 2002

Later among the works it cites.

Prime Numbers: A Computational Perspective

Crandall, R., and Pomerance, C · 2005

Later among the works it cites.

Trapdoors for hard lattices and new cryptographic constructions

Gentry, C., Peikert, C., and Vaikuntanathan, V · 2008

Later among the works it cites.

Average time fast SVP and CVP algorithms for low density lattices and the factorization of integers

Schnorr, C. P · 2010

Closest in time.