Fast implementation of Curve25519 using AVX2
From MaRDI portal
Publication:2946458
DOI10.1007/978-3-319-22174-8_18zbMATH Open1378.94040OpenAlexW1650805411MaRDI QIDQ2946458FDOQ2946458
Authors: Armando Faz-Hernández, Julio López
Publication date: 17 September 2015
Published in: Progress in Cryptology -- LATINCRYPT 2015 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-22174-8_18
Recommendations
- High-throughput elliptic curve cryptography using AVX2 vector instructions
- High-performance implementation of elliptic curve cryptography using vector instructions
- Sandy2x: new Curve25519 speed records
- Software implementation of modular exponentiation, using advanced vector instructions architectures
- High-speed Curve25519 on 8-bit, 16-bit, and 32-bit microcontrollers
elliptic curve cryptographyDiffie-Hellman protocolSIMDCurve25519prime field arithmeticAVX2vector instructions
Cites Work
Cited In (9)
- Kummer for genus one over prime-order fields
- High-throughput elliptic curve cryptography using AVX2 vector instructions
- How to (pre-)compute a ladder -- improving the performance of X25519 and X448
- Software implementation of modular exponentiation, using advanced vector instructions architectures
- High-performance implementation of elliptic curve cryptography using vector instructions
- NTRU prime: reducing attack surface at low cost
- The complete cost of cofactor \(h=1\)
- Phirsa: exploiting the computing power of vector instructions on Intel Xeon Phi for RSA
- Efficient arithmetic in (pseudo-)Mersenne prime order fields
Uses Software
This page was built for publication: Fast implementation of Curve25519 using AVX2
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2946458)