1 2007-07-05 Sebastien Pouliot <sebastien@ximian.com>
3 * PrimalityTests.cs: Last attempt half-failed. For the time being we
4 need the initial workaround :(
6 2007-07-05 Sebastien Pouliot <sebastien@ximian.com>
8 * PrimalityTests.cs: Added Test method that select which algorithm,
9 SPP or RabinMillerTest, to use based on the prime-candidate size.
10 Removed previous workaround (as this is both a workaround and a good
13 2007-07-05 Sebastien Pouliot <sebastien@ximian.com>
15 * PrimalityTests.cs: Rewritten RabinMillerTest to be closer to the
16 original algorithm (easier to understand/debug). Added a workaround
17 for #81857 when the prime is small (less than 100 bits) so we can keep
18 the a (base) == 2 optimization for larger primes.
20 2004-05-07 Sebastien Pouliot <sebastien@ximian.com>
22 * PrimalityTests.cs: Applying optimization from HAC section 4.50
23 (base == 2) for a 30% gain in primality testing (medium confidence).
25 2004-04-22 Sebastien Pouliot <sebastien@ximian.com>
27 * PrimalityTests.cs: FxCop-ized. CLS compliance. Removed local RNG.
29 2004-02-09 Sebastien Pouliot <sebastien@ximian.com>
31 * ConfidenceFactor.cs: New. Copied from corlib. Required for PKCS1 and
32 RSAManaged (which are required for TLS).
33 * PrimalityTests.cs: New. Copied from corlib. Required for PKCS1 and
34 RSAManaged (which are required for TLS).