Since you only perform one operation per key, this makes this probable. First use of that key initializes some data that takes longer to compute than your actual public key operation (for example, sliding window initialization can take as long as public key operation).This can be due to various reasons, most likely more than one: P圜rypto: around 5s for both public exponents (PE).Updated: I have tested the same operations with P圜rypto, Java (using Bouncy castle library) and C (using OpenSSL library) as well. I used the time.time() function in Python to measure the running time. However, they took almost the same time (around 27 seconds). I expected that when the public exponent was 3, the running time would be much shorter. For each exponent value, I generated 10000 RSA key pairs and measured the total time they took to encrypt the data string (not included the key-generating time). Where s is a 256-bit string and KEY_SIZE is 2048 bit. Key.public_encrypt(s, RSA.pkcs1_oaep_padding) Python and M2Crypto library were used to generate keys and do encryption: I wanted to test the performance of RSA encryption when the public exponent was 3 and when it was 65537.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |