Efficient Techniques for High-Speed Elliptic Curve Cryptography

DOI10.1007/978-3-642-15031-9_6zbMath1297.94087OpenAlexW1505980332MaRDI QIDQ3583442

Catherine H. Gebotys, Patrick Longa

Publication date: 17 August 2010

Published in: Cryptographic Hardware and Embedded Systems, CHES 2010 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-15031-9_6

zbMATH Keywords

field arithmeticelliptic curve cryptosystempoint multiplicationsoftware implementationincomplete reductionpoint operation

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (4)

Generalised Mersenne numbers revisited ⋮ Implementing the 4-dimensional GLV method on GLS elliptic curves with \(j\)-invariant 0 ⋮ Four-dimensional Gallant-Lambert-Vanstone scalar multiplication ⋮ Batch Computations Revisited: Combining Key Computations and Batch Verifications

This page was built for publication: Efficient Techniques for High-Speed Elliptic Curve Cryptography