2014
DOI: 10.1007/978-3-662-45611-8_19
|View full text |Cite
|
Sign up to set email alerts
|

Mersenne Factorization Factory

Abstract: Abstract. We present new factors of seventeen Mersenne numbers, obtained using a variant of the special number field sieve where sieving on the algebraic side is shared among the numbers. It reduced the overall factoring effort by more than 50%. As far as we know this is the first practical application of Coppersmith's "factorization factory" idea. Most factorizations used a new double-product approach that led to additional savings in the matrix step.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
11
0

Year Published

2014
2014
2020
2020

Publication Types

Select...
7

Relationship

3
4

Authors

Journals

citations
Cited by 12 publications
(11 citation statements)
references
References 28 publications
0
11
0
Order By: Relevance
“…d = 6. The current record, hold by Kleinjung et al [26], was obtained with a MNFS variant and targeted d-SNFS integers for d = 8. Their computations were much faster than the evaluated time to factor a 1024-bit RSA modulus, so it is safe to say that SNFS is the best option when log 2 Q ≈ 1024 and d = 6 or when d = 8 for slightly larger targets.…”
Section: The Case Of Primes Of Special Shape (Snfs)mentioning
confidence: 99%
“…d = 6. The current record, hold by Kleinjung et al [26], was obtained with a MNFS variant and targeted d-SNFS integers for d = 8. Their computations were much faster than the evaluated time to factor a 1024-bit RSA modulus, so it is safe to say that SNFS is the best option when log 2 Q ≈ 1024 and d = 6 or when d = 8 for slightly larger targets.…”
Section: The Case Of Primes Of Special Shape (Snfs)mentioning
confidence: 99%
“…Because in the preferred methods to find dependencies the same final matrix M is repeatedly multiplied by a (changing) vector (cf. Section 5.2.5 on page 7), it is advantageous to use this representation MT of M if W( M) + W(T ) < W(M); this approach was first used in [45].…”
Section: Filteringmentioning
confidence: 99%
“…These early experiments culminated in the summer of 1990 in the factorization of F 9 , reported by the author, Lenstra, Manasse and Pollard in [56]. Since then much more refined implementations have been used to obtain a string of factorization records for Cunningham numbers, most recently the shared factorizations from [45] mentioned in the introduction (which also uses one of the ideas from [22], described in Section 5. with f (α) = 0. Because |a| and |b| will be relatively small, the smoothness probabilities depend on the size of m, the degree d, and the sizes of the coefficients of f (X).…”
Section: Special Number Field Sievementioning
confidence: 99%
See 2 more Smart Citations