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

DOI10.1007/978-3-540-85855-3_4zbMath1180.68153OpenAlexW2169140417MaRDI QIDQ3540035

Andy Rupp, Bodo Möller

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

exponentiationDSAelliptic curve cryptographyefficient implementationECDSAembedded cryptography

Mathematics Subject Classification ID

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

Related Items (5)

On tightly-secure (linkable) ring signatures ⋮ Endomorphisms for faster elliptic curve cryptography on a large class of curves ⋮ Parallel algorithms for modular multi-exponentiation ⋮ Simplified small exponent test for batch verification ⋮ Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves

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