Accelerated Verification of ECDSA Signatures
From MaRDI portal
Recommendations
Cited in
(16)- Comments on efficient batch verification test for digital signatures based on elliptic curves
- Speeding-up verification of digital signatures
- Batch verification of ECDSA signatures
- Randomized batch verification of standard ECDSA signatures
- Batch Computations Revisited: Combining Key Computations and Batch Verifications
- Faster Multi-exponentiation through Caching: Accelerating (EC)DSA Signature Verification
- Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves
- On Modular Decomposition of Integers
- Endomorphisms for faster elliptic curve cryptography on a large class of curves
- Simplified small exponent test for batch verification
- Efficient message transmission via twisted Edwards curves
- Faster Batch Verification of Standard ECDSA Signatures Using Summation Polynomials
- Faster Addition and Doubling on Elliptic Curves
- Fast elliptic curve scalar multiplications in SN(T)ARK circuits
- Guest editorial: Special issue in honor of Scott A. Vanstone
- Finding shortest lattice vectors faster using quantum search
This page was built for publication: Accelerated Verification of ECDSA Signatures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5426199)
