Oh I'm sorry, I forgot the subject line of your post. SHA-1 and RSA. The most time consuming part will probably be the RSA decryption operations.
Operation Milliseconds/Operation Megacycles/Operation RSA 1024 Encryption 0.07 0.13 RSA 1024 Decryption 1.52 2.78 These /Operation measures refer to time to encrypt/decrypt 1 KB blocks. Processing 32KB as 32 blocks of 1024 bytes, so just multiply the milliseconds/operation by 32. On Oct 6, 9:02 pm, Tim Lovell-Smith <[EMAIL PROTECTED]> wrote: > Do you mean checking the hash result against a known value, or doing a > digital signature (e.g. RSA/ECDSA) verification? > > I think that these benchmark results are for a long stream of data, so > you may wish to apply them with a grain of salt when guessing the time > taken to hash just 32KB. But if you look at MiB/Second (mebibyte/sec > basically megabyte/sec), this might give you a rough idea of the > speed. e.g. SHA-256 does about 81 MB/sec, assuming you can keep it fed > with data that fast. The rest is just maths - 81MB/sec is (81*32) * > 32KB/sec, so you might be able to do about 2400 such hashes per second > - although there will be more overhead in doing 2400 small chunks of > 32 KB than in doing one chunk of 81MB. > > On Oct 6, 3:39 pm, Cyptmon <[EMAIL PROTECTED]> wrote: > > > Hi All, > > > I am new to cryptography and was looking for answers to the following > > questions. I saw the speeds of the various cryptographic algorithms > > herehttp://www.cryptopp.com/benchmarks.html, and was wondering how I > > can use them. I had the following question in particular > > > If I want to calculate the time for hashing 32KB of data and then > > verify the signature of this hashed value, how can I do it? > > > Thanks for all the help in advance --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the "Crypto++ Users" Google Group. To unsubscribe, send an email to [EMAIL PROTECTED] More information about Crypto++ and this group is available at http://www.cryptopp.com. -~----------~----~----~----~------~----~------~--~---
