The lattice sieve
- 918 Downloads
We describe a possible improvement to the Number Field Sieve. In theory we can reduce the time for the sieve stage by a factor comparable with log(B1). In the real world, where much factoring takes place, the advantage will be less. We used the method to repeat the factorisation of F7 on an 8-bit computer (yet again!).
KeywordsAlgebraic Number Field Short Vector Computational Number Theory Number Field Sieve Primary 11Y05
Unable to display preview. Download preview PDF.
- 1.A. K. Lenstra, H. W. Lenstra, Jr., M. S. Manasse, J. M. Pollard, The number field sieve, this volume, pp. 11–42; extended abstract: Proc. 22nd Annual ACM Symp. on Theory of Computing (STOC), Baltimore, May 14–16, 1990, 564–572.Google Scholar
- 2.A. K. Lenstra, H. W. Lenstra, Jr., M. S. Manasse, J. M. Pollard, The factorization of the ninth Fermat number, Math. Comp. 61 (1993), to appear.Google Scholar
- 3.J. M. Pollard, Factoring with cubic integers, unpublished manuscript, 1988; this volume, pp. 4–10.Google Scholar