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
..
1999-04-29 16:04:54 +00:00
2000-01-23 22:06:24 +00:00
2000-06-09 09:11:30 +00:00
2000-08-22 21:23:09 +00:00
2000-02-16 13:24:06 +00:00
2000-02-16 13:24:06 +00:00
2000-09-04 15:30:14 +00:00
2000-03-02 22:08:30 +00:00
2000-02-05 21:28:09 +00:00
2000-09-07 08:46:51 +00:00