Accelerated Verification of ECDSA Signatures

Antipa, Adrian; Brown, Daniel R. L.; Gallant, Robert P.; Lambert, Rob; Struik, René; Vanstone, Scott A.

doi:10.1007/11693383_21

Cited by 38 publications

(45 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We have also considered the verification method suggested by Antipa, Brown, Gallant, Lambert, Struik, and Vanstone in [7], but our very efficient ellipticcurve arithmetic makes the overheads in this method -extra decompression and a Euclidean computation -much more troublesome. In the batch context discussed below, the only extra overhead of the method of [7] would be the Euclidean computation, but the benefit would also be much smaller.…”

Section: Verifying Signaturesmentioning

confidence: 99%

See 1 more Smart Citation

High-speed high-security signatures

et al. 2012

View full text Add to dashboard Cite

Abstract. This paper shows that a $390 mass-market quad-core 2.4GHz Intel Westmere (Xeon E5620) CPU can create 109000 signatures per second and verify 71000 signatures per second on an elliptic curve at a 2 128 security level. Public keys are 32 bytes, and signatures are 64 bytes. These performance figures include strong defenses against software sidechannel attacks: there is no data flow from secret keys to array indices, and there is no data flow from secret keys to branch conditions.

show abstract

Section: Verifying Signaturesmentioning

confidence: 99%

“…In the batch context discussed below, the only extra overhead of the method of [7] would be the Euclidean computation, but the benefit would also be much smaller.…”

Section: Verifying Signaturesmentioning

confidence: 99%

High-speed high-security signatures

et al. 2012

View full text Add to dashboard Cite

show abstract

“…We have also considered the verification method suggested by Antipa, Brown, Gallant, Lambert, Struik, and Vanstone in [2], but our very efficient ellipticcurve arithmetic makes the overheads in this method -extra decompression and a Euclidean computation -much more troublesome. In the batch context discussed below, the only extra overhead of the method of [2] would be the Euclidean computation, but the benefit would also be much smaller.…”

Section: Fast Decompressionmentioning

confidence: 99%

“…In the batch context discussed below, the only extra overhead of the method of [2] would be the Euclidean computation, but the benefit would also be much smaller.…”

Section: Fast Decompressionmentioning

confidence: 99%

High-Speed High-Security Signatures

Bernstein

Duif

Lange

et al. 2011

Lecture Notes in Computer Science

140

107

View full text Add to dashboard Cite

Abstract. This paper shows that a $390 mass-market quad-core 2.4GHz Intel Westmere (Xeon E5620) CPU can create 108000 signatures per second and verify 71000 signatures per second on an elliptic curve at a 2 128 security level. Public keys are 32 bytes, and signatures are 64 bytes. These performance figures include strong defenses against software sidechannel attacks: there is no data flow from secret keys to array indices, and there is no data flow from secret keys to branch conditions.

show abstract

“…Our batch verification algorithm is applied to the modified ECDSA [ABGLSV05] as in DSA case. The security of the modified ECDSA is equivalent to the standard ECDSA [ABGLSV05]. Let E be an elliptic curve.…”

Section: Modified Ecdsamentioning

confidence: 99%

Fast Batch Verification of Multiple Signatures

Cheon

Public Key Cryptography – PKC 2007

View full text Add to dashboard Cite

Abstract. We propose an efficient batch verification of multiple signatures generated by different signers as well as a single signer. We first introduce a method to generate width-w Non-Adjacent Forms (w-NAFs) uniformly. We then propose a batch verification algorithm of exponentiations using w-NAF exponents, and apply this to batch verification for the modified DSA and ECDSA signatures. The performance analysis shows that our proposed method is asymptotically seven and four times as fast as individual verification in case of a single signer and multiple signers, respectively. Further, the proposed algorithm can be generalized into τ -adic w-NAFs over Koblitz curves and requires asymptotically only six elliptic curve additions per each signature for batch verification of the modified ECDSA signatures by a single singer. Our result is the first one to efficiently verify multiple signatures by multiple signers that can introduce much wider applications.

show abstract

Accelerated Verification of ECDSA Signatures

Cited by 38 publications

References 4 publications

High-speed high-security signatures

High-speed high-security signatures

High-Speed High-Security Signatures

Fast Batch Verification of Multiple Signatures

Contact Info

Product

Resources

About