Efficient techniques for high-speed elliptic curve cryptography
DOI10.1007/978-3-642-15031-9_6zbMATH Open1297.94087OpenAlexW1505980332MaRDI QIDQ3583442FDOQ3583442
Authors: Patrick Longa, Catherine H. Gebotys 
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
Recommendations
- High Speed Compact Elliptic Curve Cryptoprocessor for FPGA Platforms
- A high-speed elliptic curve cryptographic processor for generic curves over \(\mathrm{GF}(p)\)
- A high speed coprocessor for elliptic curve scalar multiplications over \(\mathbb{F}_p\)
- High-throughput elliptic curve cryptography using AVX2 vector instructions
- Twisted Edwards Curves Revisited
field arithmeticelliptic curve cryptosystempoint multiplicationsoftware implementationincomplete reductionpoint operation
Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Cited In (12)
- Fast Elliptic-Curve Cryptography on the Cell Broadband Engine
- High-throughput elliptic curve cryptography using AVX2 vector instructions
- Implementing the 4-dimensional GLV method on GLS elliptic curves with \(j\)-invariant 0
- Batch Computations Revisited: Combining Key Computations and Batch Verifications
- Title not available (Why is that?)
- Title not available (Why is that?)
- High-performance implementation of elliptic curve cryptography using vector instructions
- Four-dimensional Gallant-Lambert-Vanstone scalar multiplication
- Generalised Mersenne numbers revisited
- Efficient elliptic curve cryptosystems
- Efficient algorithms for speeding up the computations of elliptic curve cryptosystems
- Title not available (Why is that?)
This page was built for publication: Efficient techniques for high-speed elliptic curve cryptography
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3583442)
