Fast Implementation of Curve25519 Using AVX2

DOI10.1007/978-3-319-22174-8_18zbMath1378.94040OpenAlexW1650805411MaRDI QIDQ2946458

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

zbMATH Keywords

elliptic curve cryptographyDiffie-Hellman protocolSIMDCurve25519prime field arithmeticAVX2vector instructions

Mathematics Subject Classification ID

Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (8)

High-throughput elliptic curve cryptography using AVX2 vector instructions ⋮ The complete cost of cofactor \(h=1\) ⋮ Phirsa: exploiting the computing power of vector instructions on Intel Xeon Phi for RSA ⋮ How to (pre-)compute a ladder -- improving the performance of X25519 and X448 ⋮ NTRU prime: reducing attack surface at low cost ⋮ High-performance Implementation of Elliptic Curve Cryptography Using Vector Instructions ⋮ Kummer for genus one over prime-order fields ⋮ Efficient arithmetic in (pseudo-)Mersenne prime order fields

Uses Software

• gmp
• eBACS
• RELIC
• NaCl
• OpenSSL
• DNSCurve

Cites Work

• A fast algorithm for computing multiplicative inverses in \(\text{GF}(2^ m)\) using normal bases
• Faster ECC over $$\mathbb {F}_{2^{521}-1}$$
• Speeding the Pollard and Elliptic Curve Methods of Factorization
• Handbook of Elliptic and Hyperelliptic Curve Cryptography
• Public Key Cryptography - PKC 2006

This page was built for publication: Fast Implementation of Curve25519 Using AVX2