Geoff Thorpe 79221bc265 David Brumley <dbrumley@stanford.edu> noted and corrected a case in the
verification step of CRT private key operations in the RSA code -
previously no montgomery form was checked or used for 'n', and so it would
be generated on the fly each time. As a result, private key operations are
now a percent or two faster.

Rather than adding this as another repetition of the nearly-identical
montgomery "check for first-use" initialisation code blocks, I've taken
this chance to create a helper function and macro-wrapper to replace them.

PR: 475
2003-02-14 23:21:19 +00:00
..
1999-04-29 16:04:54 +00:00
2002-12-29 01:38:15 +00:00
2001-07-27 02:22:42 +00:00
2002-12-08 16:45:26 +00:00
2001-07-25 17:02:58 +00:00
2000-11-06 22:34:17 +00:00
2000-11-06 22:34:17 +00:00