Please do not reply to this email- if you want to comment on the bug, go to the URL shown below and enter your comments there.
Changed by [EMAIL PROTECTED] http://bugzilla.ximian.com/show_bug.cgi?id=81857 --- shadow/81857 2007-07-05 11:09:04.000000000 -0400 +++ shadow/81857.tmp.2734 2007-07-05 11:52:31.000000000 -0400 @@ -144,6 +144,13 @@ Assert.AreEqual (expected, manual, "b * b % mod"); // fails (inside Barrett reduction) // BigInteger actual = b.ModPow (exp, mod); // Assert.AreEqual (expected, actual, "b.ModPow (exp, mod)"); } + +------- Additional Comments From [EMAIL PROTECTED] 2007-07-05 11:52 ------- +Changed my workaround for one that makes more sense (i.e. that I'll +keep even when the bug is fixed). SVN r81398-9 will select the best +algorithm (SPP or RM) to check primality. This works around the +current bug and also fix the 65537 corner case (as no random value is +required). _______________________________________________ mono-bugs maillist - [email protected] http://lists.ximian.com/mailman/listinfo/mono-bugs
