Faster Multi-exponentiation through Caching: Accelerating (EC)DSA Signature Verification

DOI10.1007/978-3-540-85855-3_4MaRDI QIDQ3540035zbMATH OpenOpenAlexFDO

Authors Bodo Möller, Andy Rupp

Publication date 20 November 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-85855-3_4

zbMATH Keywords

DSAECDSAefficient implementationelliptic curve cryptographyembedded cryptographyexponentiation

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Fast Batch Verification of Multiple Signatures
• Accelerated Verification of ECDSA Signatures
• Batch verification of ECDSA signatures
• scientific article; zbMATH DE number 1303126
• Improved DSA variant for batch verification

Cited in

(6)

• Parallel algorithms for modular multi-exponentiation
• On tightly-secure (linkable) ring signatures
• Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves
• Endomorphisms for faster elliptic curve cryptography on a large class of curves
• Simplified small exponent test for batch verification
• Faster Batch Verification of Standard ECDSA Signatures Using Summation Polynomials

This page was built for publication: Faster Multi-exponentiation through Caching: Accelerating (EC)DSA Signature Verification

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