2004-12-03  Sebastien Pouliot  <sebastien@ximian.com>

	* BigInteger.cs: Fix issue #70169 in ModPow when modulus is a power of
	two.

2004-10-19  Sebastien Pouliot  <sebastien@ximian.com>

	* BigInteger.cs: Fix issue #68452 when Randomize was being called on a
	0 BigInteger (i.e. BitCount == 0).

2004-09-17  Sebastien Pouliot  <sebastien@ximian.com>

	* BigInteger.cs: In sync with corlib. This fix level 4 warnings about
	CLSCompliant.

2004-05-07  Sebastien Pouliot  <sebastien@ximian.com>

	* BigInteger.cs: Faster scan of smallPrimes in IsProbablePrime. 
	Commented the methods OddModTwoPow and EvenModTwoPow as they are broken
	in some cases (well tested primes test case). 
	
2004-04-22  Sebastien Pouliot  <sebastien@ximian.com>

	* BigInteger.cs: FxCop-ized. CLS compliance.

2004-02-23  Sebastien Pouliot  <sebastien@ximian.com>

	* BigInteger.cs: Corrected isProbablePrime by removing the redundant 
	loop. Fix #54750.

2004-02-13  Sebastien Pouliot  <sebastien@ximian.com>

	* BigInteger.cs: Fixed isProbablePrime() and added Parse method from
	patch provided by Pieter (#51229). Changed SmallPrimeSppTest to 
	RabinMillerTest (#51229, #54262). Removed obsoleted method
	isProbablePrime(int).

2004-02-09  Sebastien Pouliot  <sebastien@ximian.com>

	* BigInteger.cs: New. Copied from corlib. Required for PKCS1 and
	RSAManaged (which are required for TLS).