[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [GNU Crypto] Bug in gnu.util.Prime.passEulerCriterion(java.math.BigI
From: |
Casey Marshall |
Subject: |
Re: [GNU Crypto] Bug in gnu.util.Prime.passEulerCriterion(java.math.BigInteger) |
Date: |
Tue, 27 Apr 2004 20:01:55 -0700 |
User-agent: |
Gnus/5.1002 (Gnus v5.10.2) Emacs/21.2 (gnu/linux) |
-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1
>>>>> "Marcel" == Marcel Winandy <address@hidden> writes:
Marcel> Hi! Am Dienstag, 20. April 2004 07:51 schrieb Casey Marshall:
>> Ugh, I'm getting increasingly tired of the Prime class; I'm
>> considering just punting this class and using
>> BigInteger.isProbablePrime instead.
Marcel> Unfortunately, BigInteger.isProbablePrime still contains a bug
Marcel> in its implementation of the, I think, Lucas algorithm, which
Marcel> renders a lot of primes as composites or even the other way
Marcel> round (I can't remember at the moment).
I seriously hope it generates false negatives, and not false
positives; one is an inconvenience, the other is a vulnerability.
Maybe instead we can just advocate GNU Classpath more vehemently,
since its implementation doesn't suffer from these bugs (that we know
of), nor from the glacial pace of Sun Microsystems.
- --
Casey Marshall || address@hidden
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.2.3 (GNU/Linux)
Comment: Processed by Mailcrypt 3.5.7 <http://mailcrypt.sourceforge.net/>
iD8DBQFAjx6cgAuWMgRGsWsRAmIZAJ9wBkV5BHYnPxj+ETDDlQOG3zkwSQCePlh9
pLIeDkFgqg0wg7xFNCzIFYw=
=As7x
-----END PGP SIGNATURE-----