Hi All,
I did a quick sanity check on performance of my RSA implementation
with following parameters:
p =
102639592829741105772054196573991675900716567808038066803341933521790711307779
q =
106603488380168454820927220360012878679207958575989291522270608237193062808643
n = p * q [n has bit 511 set]
e = 17
I caculate [ciphertext = plaintext raised to e mod n] at just over
44,000 operations per second.
My code is un-optimized C++, with some assistive assembly, compiled
under Visual C++ 2005, running in Release mode on:
Microsoft® Windows Vista™ Ultimate
AMD Athlon(tm) 64 X2 Dual Core Processor 3600+, 1900 Mhz, 2 Core(s), 2
Logical Processor(s)
2.0 GB RAM
For a quick comparison I looked an OpenSSL performance table:
http://lists.freebsd.org/pipermail/freebsd-performance/2004-November/000956.html