TY  - RPRT
A1  - Ritter, Harald
A1  - Rössner, Carsten
T1  - Factoring via strong lattice reduction algorithm : technical report
N2  - We address to the problem to factor a large composite number by lattice reduction algorithms. Schnorr has shown that under a reasonable number theoretic assumptions this problem can be reduced to a simultaneous diophantine approximation problem. The latter in turn can be solved by finding sufficiently many l_1--short vectors in a suitably defined lattice. Using lattice basis reduction algorithms Schnorr and Euchner applied Schnorrs reduction technique to 40--bit long integers. Their implementation needed several hours to compute a 5% fraction of the solution, i.e., 6 out of 125 congruences which are necessary to factorize the composite. In this report we describe a more efficient implementation using stronger lattice basis reduction techniques incorporating ideas of Schnorr, Hoerner and Ritter. For 60--bit long integers our algorithm yields a complete factorization in less than 3 hours.
Y1  - 1997
UR  - http://publikationen.ub.uni-frankfurt.de/frontdoor/index/index/docId/4226
UR  - https://nbn-resolving.org/urn:nbn:de:hebis:30-12628
UR  - http://www.mi.informatik.uni-frankfurt.de/research/papers.html
UR  - http://eprint.iacr.org/1997/008
IS  - May 16, 1997
SP  - 1
EP  - 9
ER  -