Tell me more ×
Cryptography Stack Exchange is a question and answer site for software developers, mathematicians and others interested in cryptography. It's 100% free, no registration required.
up vote 0 down vote favorite

I doing to compare two algorithm cryptography. first algorithm is RSA cryptography and second algorithm is El Gamal elliptic curve cryptography. now I want a way to compare between two algorithm by the speed in completing calculations. someone tell me about compute time complexity. Is that true. Please I waiting for any suggest. Thank you for all.

share|improve this question
Don't compute, measure. And check out bench.cr.yp.to which lists performance of both DH on different groups and RSA. Though I heard that the RSA implementation they use might be rather slow. – CodesInChaos Jan 21 at 12:28
Write a sample program that makes note of the current time, do the encryption, then make note of the time a second time. You should be able to compute the time it takes for each algorithm. – ponsfonze Jan 21 at 17:10
Compute time it isn't good measured. because give me time variable each runtime program. I want know. Is calculate Time Complexity good measured. I want link for any book to learn me. Thanks for all. – almodawan Jan 21 at 18:15
Is there general way to calculate speed performance for encrypt and decrypt.to be able to compare between any two algorithms in terms of speed? I need that for my thesis. – almodawan Jan 21 at 18:25
No, there isn't. Big-O complexity is asymptotic - in addition to being an average - and is generally not accurate for realistic key sizes. In addition, some theoretically fast algorithms are terribly slow because they are not amenable to an efficient implementation, etc.. your best bet is to measure it, IMHO. – Thomas Jan 22 at 0:18
show 2 more comments

Know someone who can answer? Share a link to this question via email, Google+, Twitter, or Facebook.

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.