3 Dec
1992
3 Dec
'92
11:53 p.m.
RSA seems to depend on doing modulo-multiply on big integers. What are the relative speeds of the different modmults in PGP (modulo processor speed)... Also consider reliability. As of 2.0, modmult on the SPARC (using the MERRITT code) fails on some keys, while either the PEASANT or UPTON routines function correctly but are slower. (I haven't had time to test them in parallel and find where they diverge, but there is a large keyring "out there" that breaks the MERRITT code in several
places...) (on the main thread, yes, understanding "the whole thing" is a good idea, and perhaps modifying the code to make this easier is a useful development goal...) _Mark_