[GNU Crypto] Bug in gnu.util.Prime.passEulerCriterion(java.math.BigInteger)

[Eric Gilbert]

Hello,

You may already know about this one, but I figured it would be nice to pass it 
on if you
don't.  I am integrating the GNU Crypto primality testing code into my own 
project
CatCon, http://catcon.sourceforge.net/pub/.  The method
gnu.util.Prime.passEulerCriterion(java.math.BigInteger)wrongly identifies the 
following
numbers as composite:

38737
61681
65537
229153
274177

These are all of the primes less than 300000 that passEulerCriterion 
incorrectly labels
as composite.  There are more, I am sure, probably having some identifying
characteristic.  Just thought you ought to know.

Good luck and great project,
Eric

=====
In a democracy dissent is an act of faith. Like medicine, the test of its value 
is not in its taste, but in its effects. -J. William Fulbright, US Senator 
(1905-1995)