Hi There
Could someone please tell me why openssl is so fast at generating large ( 1024bit and up ) keys. I've seen other examples that use basic modular exponentiation and a good large integer library to generate keys. In fact this was done in mathematica which uses the GMP library - wiki. But when 1024 bit keys are generated with this, it takes 10 to 100 times longer than what openssl does. Is it only montgomery reduction that makes such a difference or something else? I did search on the topic and didn't come up with anything. -- View this message in context: http://old.nabble.com/OpenSSL-Perfornace-tp34288535p34288535.html Sent from the OpenSSL - Dev mailing list archive at Nabble.com. ______________________________________________________________________ OpenSSL Project http://www.openssl.org Development Mailing List [email protected] Automated List Manager [email protected]
