Re: 42nd Known Mersenne Prime Found == 2^25,964,951-1 == The number has 7,816,230 digits

From: D. J. Bernstein (djb_at_cr.yp.to)
Date: 03/01/05 

Date: Tue, 1 Mar 2005 03:58:11 +0000 (UTC)

> The kind of big-integer multiplication used for Mersennes is far removed
> from what you'd use in crypto (FFTs instead of Karatsuba).

FFT-based multiplication of huge integers---billions of digits, far
beyond current Mersenne computations---turns out to be useful for
speeding up the number-field sieve.

---D. J. Bernstein, Associate Professor, Department of Mathematics,
Statistics, and Computer Science, University of Illinois at Chicago

Quantcast