1 2004-12-03 Sebastien Pouliot <sebastien@ximian.com>
3 * BigInteger.cs: Fix issue #70169 in ModPow when modulus is a power of
6 2004-10-19 Sebastien Pouliot <sebastien@ximian.com>
8 * BigInteger.cs: Fix issue #68452 when Randomize was being called on a
9 0 BigInteger (i.e. BitCount == 0).
11 2004-09-17 Sebastien Pouliot <sebastien@ximian.com>
13 * BigInteger.cs: In sync with corlib. This fix level 4 warnings about
16 2004-05-07 Sebastien Pouliot <sebastien@ximian.com>
18 * BigInteger.cs: Faster scan of smallPrimes in IsProbablePrime.
19 Commented the methods OddModTwoPow and EvenModTwoPow as they are broken
20 in some cases (well tested primes test case).
22 2004-04-22 Sebastien Pouliot <sebastien@ximian.com>
24 * BigInteger.cs: FxCop-ized. CLS compliance.
26 2004-02-23 Sebastien Pouliot <sebastien@ximian.com>
28 * BigInteger.cs: Corrected isProbablePrime by removing the redundant
31 2004-02-13 Sebastien Pouliot <sebastien@ximian.com>
33 * BigInteger.cs: Fixed isProbablePrime() and added Parse method from
34 patch provided by Pieter (#51229). Changed SmallPrimeSppTest to
35 RabinMillerTest (#51229, #54262). Removed obsoleted method
38 2004-02-09 Sebastien Pouliot <sebastien@ximian.com>
40 * BigInteger.cs: New. Copied from corlib. Required for PKCS1 and
41 RSAManaged (which are required for TLS).