The results are presented of experiments with the multiple polynomial version of the quadratic sieve factorization method on a CYBER 205 and on a NEC SX-2 vector computer. Various numbers in the 50–92 decimal digits range have been factorized, as a contribution to (i) the Cunningham project, (ii) Brent's table of factors of Mersenne numbers, and (iii) a proof by Brent and G. Cohen of the non-existence of odd perfect numbers below 10200. The factorized 92-decimal digits number is a record for general purpose factorization methods
textabstractThe Number Field Sieve (NFS) is the asymptotically fastest known factoring algorithm for...
The number field sieve is an algorithm for finding the prime factors of large integers. It depends o...
We report the factorization of a 135-digit integer by the triple-large-prime variation of the multip...
The results are presented of experiments with the multiple polynomial version of the quadratic sieve...
AbstractThe results are presented of experiments with the multiple polynomial version of the quadrat...
We present the results of many factorization runs with the single and double large prime variations ...
This thesis aims at implementing methods for factorisation of large numbers. Seeing that there is no...
Integer factorization is a problem not yet solved for arbitrary integers. Huge integers are therefor...
GQS is a set of computer programs for factoring “large ” inte-gers. It is based on multiple polynomi...
We describe a modification to the well-known large prime variant of the multiple polynomial quadrati...
Abstract. We describe how we reached a new factoring milestone by completing the first special numbe...
Factoring large integers has long been a subject that has interested mathematicians. And although th...
In my last paper, I described the Quadratic Sieve (QS) and it’s variants, including a very abbreviat...
Colloque avec actes sans comité de lecture.International audienceOn February 2, 1999, we completed t...
We describe a single-instruction multiple data (SIMD) implementation of the multiple polynomial quad...
textabstractThe Number Field Sieve (NFS) is the asymptotically fastest known factoring algorithm for...
The number field sieve is an algorithm for finding the prime factors of large integers. It depends o...
We report the factorization of a 135-digit integer by the triple-large-prime variation of the multip...
The results are presented of experiments with the multiple polynomial version of the quadratic sieve...
AbstractThe results are presented of experiments with the multiple polynomial version of the quadrat...
We present the results of many factorization runs with the single and double large prime variations ...
This thesis aims at implementing methods for factorisation of large numbers. Seeing that there is no...
Integer factorization is a problem not yet solved for arbitrary integers. Huge integers are therefor...
GQS is a set of computer programs for factoring “large ” inte-gers. It is based on multiple polynomi...
We describe a modification to the well-known large prime variant of the multiple polynomial quadrati...
Abstract. We describe how we reached a new factoring milestone by completing the first special numbe...
Factoring large integers has long been a subject that has interested mathematicians. And although th...
In my last paper, I described the Quadratic Sieve (QS) and it’s variants, including a very abbreviat...
Colloque avec actes sans comité de lecture.International audienceOn February 2, 1999, we completed t...
We describe a single-instruction multiple data (SIMD) implementation of the multiple polynomial quad...
textabstractThe Number Field Sieve (NFS) is the asymptotically fastest known factoring algorithm for...
The number field sieve is an algorithm for finding the prime factors of large integers. It depends o...
We report the factorization of a 135-digit integer by the triple-large-prime variation of the multip...