Faster Batch Verification of Standard ECDSA Signatures Using Summation Polynomials

DOI10.1007/978-3-319-07536-5_26MaRDI QIDQ5168560zbMATH OpenOpenAlexFDO

Authors Sabyasachi Karati, Abhijit Das

Publication date 7 July 2014

Published in Applied Cryptography and Network Security (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-07536-5_26

zbMATH Keywords

batch verificationECDSAEdDSAEdwards curveelliptic curveKoblitz curvesummation polynomial

Mathematics Subject Classification ID

Applications to coding theory and cryptography of arithmetic geometry (14G50) Elliptic curves (14H52) Cryptography (94A60)

Recommendations

• Accelerated Verification of ECDSA Signatures
• Randomized batch verification of standard ECDSA signatures
• scientific article; zbMATH DE number 1303126
• Batch verification of ECDSA signatures
• A fast signature scheme based on congruential polynomial operations
• Faster Multi-exponentiation through Caching: Accelerating (EC)DSA Signature Verification
• scientific article; zbMATH DE number 3912273
• Comments on efficient batch verification test for digital signatures based on elliptic curves
• scientific article; zbMATH DE number 4070803
• Homomorphic signatures with efficient verification for polynomial functions

Cited in

(5)

• The matrix reloaded: multiplication strategies in FrodoKEM
• Batch verification of ECDSA signatures
• Randomized batch verification of standard ECDSA signatures
• Accelerated Verification of ECDSA Signatures
• Fast Batch Verification of Multiple Signatures

This page was built for publication: Faster Batch Verification of Standard ECDSA Signatures Using Summation Polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5168560)