How to (pre-)compute a ladder -- improving the performance of X25519 and X448

DOI10.1007/978-3-319-72565-9_9zbMath1384.94093OpenAlexW2779269605MaRDI QIDQ1746965

Thomaz Oliveira, Armando Faz-Hernández, Julio López, Francisco Rodríguez-Henríquez, Huseyin Hisil

Publication date: 26 April 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-72565-9_9

zbMATH Keywords

Diffie-Hellman protocolMontgomery ladderelliptic curve scalar multiplicationRFC 7748

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (max. 100)

Kummer versus Montgomery Face-off over Prime Order Fields ⋮ A Secure and Efficient Implementation of the Quotient Digital Signature Algorithm (qDSA) ⋮ The complete cost of cofactor \(h=1\) ⋮ Time-efficient finite field microarchitecture design for Curve448 and Ed448 on Cortex-M4 ⋮ High-performance Implementation of Elliptic Curve Cryptography Using Vector Instructions ⋮ Efficient arithmetic in (pseudo-)Mersenne prime order fields

Uses Software

• Magma
• eBACS

Cites Work

• Unnamed Item
• Unnamed Item
• The Magma algebra system. I: The user language
• Fast Point Multiplication Algorithms for Binary Elliptic Curves with and without Precomputation
• Sandy2x: New Curve25519 Speed Records
• Four $$\mathbb {Q}$$ : Four-Dimensional Decompositions on a $$\mathbb {Q}$$ -curve over the Mersenne Prime
• Fast Implementation of Curve25519 Using AVX2
• High-Speed High-Security Signatures
• Fast Multi-precision Multiplication for Public-Key Cryptography on Embedded Microprocessors
• Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
• Highly Regular Right-to-Left Algorithms for Scalar Multiplication
• Speeding the Pollard and Elliptic Curve Methods of Factorization
• Elliptic Curve Cryptosystems
• New directions in cryptography
• Montgomery Curves and the Montgomery Ladder
• Public Key Cryptography - PKC 2006

This page was built for publication: How to (pre-)compute a ladder -- improving the performance of X25519 and X448