Paper 2012/582

Using Randomizers for Batch Verification of ECDSA Signatures

Sabyasachi Karati, 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*.

Metadata
Available format(s)
PDF PS
Category
Public-key cryptography
Publication info
Published elsewhere. Unknown where it was published
Keywords
Digital SignatureElliptic CurveECDSAECDSA*Batch VerificationSymbolic ComputationRandomizerMontgomery Ladder.
Contact author(s)
abhij @ cse iitkgp ernet in
History
2012-10-16: received
Short URL
https://ia.cr/2012/582
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2012/582,
      author = {Sabyasachi Karati and Abhijit Das and Dipanwita Roychowdhury},
      title = {Using Randomizers for Batch Verification of ECDSA Signatures},
      howpublished = {Cryptology ePrint Archive, Paper 2012/582},
      year = {2012},
      note = {\url{https://eprint.iacr.org/2012/582}},
      url = {https://eprint.iacr.org/2012/582}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.