gnu-crypto-discuss
[Top][All Lists]
Advanced

[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: Marcel Winandy
Subject: Re: [GNU Crypto] Bug in gnu.util.Prime.passEulerCriterion(java.math.BigInteger)
Date: Tue, 27 Apr 2004 17:37:45 +0200
User-agent: KMail/1.4.3

-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1

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.

Unfortunately, BigInteger.isProbablePrime still contains a bug in its 
implementation of the, I think, Lucas algorithm, which renders a lot of 
primes as composites or even the other way round (I can't remember at the 
moment).

Best regards,
- -- 
Marcel Winandy
EMail:  address@hidden
Privat: http://home.pages.de/~winandy/marcel/
Firma:  http://www.winandy.de

-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.0.7 (GNU/Linux)

iD8DBQFAjn5MjqlzsXwzXNwRAn+RAKCscjV0g3oLWSLeLdylvfjvtth6fACdHHFC
uNcNFyZ68wwghic7/URM3DU=
=a4rN
-----END PGP SIGNATURE-----





reply via email to

[Prev in Thread] Current Thread [Next in Thread]