Factoring with Two Large Primes

descriptionPublicationkeyboard_double_arrow_right Article , Part of book or chapter of book , Conference object 01 Jan 1991Publisher:JSTORJournal:Mathematics of Computation, volume 63, page 785 (issn: 0025-5718,

Copyright policy )

Authors: Arjen K. Lenstra; Mark S. Manasse;

doi: 10.2307/2153299 , 10.1007/3-540-46877-3_7 , 10.1090/s0025-5718-1994-1250773-9

Factoring with Two Large Primes

- Summary
- Subjects
- Metrics

Abstract

Summary: We describe a modification to the well-known large prime variant of the multiple polynomial quadratic sieve factoring algorithm [Eurocrypt '90, Lect. Notes Comput. Sci. 473, 72--82 (1991; Zbl 0779.11061)]. In practice this leads to a speed-up factor of 2 to 2.5. We discuss several implementation-related aspects, and we include some examples. Our new variation is also of practical importance for the number field sieve factoring algorithm.

Related Organizations

Telcordia Technologies
United States

Keywords

factoring algorithm, number field sieve, Factorization, multiple polynomial quadratic sieve, Number-theoretic algorithms; complexity

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	37
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 1%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Top 10%