Cryptology ePrint Archive: Report 2012/582

Using Randomizers for Batch Verification of ECDSA Signatures

Sabyasachi Karati and Abhijit Das and Dipanwita Roychowdhury

Abstract: Randomizers are popularly used to prevent various types of attacks on batch-verification schemes. Recently, several algorithms based upon symbolic computation are proposed for the batch verification of ECDSA signatures. In this article, we demonstrate that the concept of randomizers can be easily embedded in these symbolic-computation algorithms. The performance degradation caused by randomizers is comparable with that associated with ECDSA*.

Category / Keywords: public-key cryptography / Digital Signature, Elliptic Curve, ECDSA, ECDSA*, Batch Verification, Symbolic Computation, Randomizer, Montgomery Ladder.

Date: received 12 Oct 2012, last revised 13 Oct 2012

Contact author: abhij at cse iitkgp ernet in

Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation

Version: 20121016:132458 (All versions of this report)

Short URL:

Discussion forum: Show discussion | Start new discussion

[ Cryptology ePrint archive ]