I am using ECDSA as a digital signature scheme. Using Charm, I got the timing for the multiplication, exponentiation, and pairing operations; they take 0.005, 9, and 4.4 ms respectively. I want to estimate the computation overhead to sign and verify a message. Any suggestions please.

  • $\begingroup$ Have you tried yourself to map it to the operations that are specified for ECDSA? $\endgroup$ – Maarten Bodewes Jun 28 '20 at 20:06
  • $\begingroup$ I am new to crypto. I am learning. could you please help me to map that. $\endgroup$ – Heba Mohsen Jun 28 '20 at 20:13
  • $\begingroup$ I don't see you listed as one of the authors of this paper which list explicitly these timings for the given operations. Generally we do require you to put in some effort other than to copy some data and hastily write a question around it, posting it before even proofreading it. $\endgroup$ – Maarten Bodewes Jun 28 '20 at 20:14
  • $\begingroup$ yes, I got the numbers form that paper $\endgroup$ – Heba Mohsen Jun 28 '20 at 20:15
  • 1
    $\begingroup$ Please correct me if I am wrong. The signing approximately took 2 multiplication operations. while the verification algorithm costs 4 multiplication operations. I used the ECDSA from Wikipedia at en.wikipedia.org/wiki/… $\endgroup$ – Heba Mohsen Jun 28 '20 at 20:21

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.