Bodo Möller fe03519704 Totally remove the supposedly 'faster' variant in
BN_mod_mul_montgomery, which calls bn_sqr_recursive
without much preparation.

bn_sqr_recursive requires the length of its argument to be
a power of 2, which is not always the case here.
There's no reason for not using BN_sqr -- if a simpler
approach to squaring made sense, then why not change
BN_sqr?  (Using BN_sqr should also speed up DH where g is chosen
such that it becomes small [e.g., 2] when converted
to Montgomery representation.)

Case closed :-)
2000-09-19 23:25:00 +00:00
..
2000-09-07 08:46:51 +00:00
2000-06-03 14:13:58 +00:00
2000-09-07 08:46:51 +00:00
2000-09-09 18:05:27 +00:00
2000-09-09 04:45:18 +00:00
2000-09-07 08:46:51 +00:00
2000-09-07 08:46:51 +00:00
2000-09-07 08:46:51 +00:00
2000-09-07 08:46:51 +00:00
2000-06-03 14:13:58 +00:00
2000-09-07 08:46:51 +00:00
2000-09-07 08:46:51 +00:00
2000-09-05 12:42:05 +00:00
2000-09-07 08:46:51 +00:00
2000-09-07 08:46:51 +00:00
2000-09-07 08:46:51 +00:00
2000-06-03 14:13:58 +00:00
2000-06-03 14:13:58 +00:00
2000-09-07 08:46:51 +00:00
2000-09-07 08:46:51 +00:00
2000-09-07 23:14:26 +00:00
2000-02-01 02:21:16 +00:00
2000-09-18 16:07:20 +00:00
2000-09-07 08:46:51 +00:00
2000-02-16 12:09:17 +00:00