How to (pre-)compute a ladder -- improving the performance of X25519 and X448
From MaRDI portal
Publication:1746965
DOI10.1007/978-3-319-72565-9_9zbMATH Open1384.94093OpenAlexW2779269605MaRDI QIDQ1746965FDOQ1746965
Huseyin Hisil, Thomaz Oliveira, Armando Faz-Hernández, Julio López, Francisco Rodríguez-Henríquez
Publication date: 26 April 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-72565-9_9
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Magma algebra system. I: The user language
- Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
- New directions in cryptography
- High-Speed High-Security Signatures
- Speeding the Pollard and Elliptic Curve Methods of Factorization
- Elliptic Curve Cryptosystems
- Public Key Cryptography - PKC 2006
- Highly Regular Right-to-Left Algorithms for Scalar Multiplication
- Sandy2x: New Curve25519 Speed Records
- Fast Implementation of Curve25519 Using AVX2
- Fast Multi-precision Multiplication for Public-Key Cryptography on Embedded Microprocessors
- Four $$\mathbb {Q}$$ : Four-Dimensional Decompositions on a $$\mathbb {Q}$$ -curve over the Mersenne Prime
- Fast Point Multiplication Algorithms for Binary Elliptic Curves with and without Precomputation
- Montgomery Curves and the Montgomery Ladder
Cited In (7)
- Kummer versus Montgomery Face-off over Prime Order Fields
- Binary Kummer line
- The complete cost of cofactor \(h=1\)
- A Secure and Efficient Implementation of the Quotient Digital Signature Algorithm (qDSA)
- High-performance Implementation of Elliptic Curve Cryptography Using Vector Instructions
- Efficient arithmetic in (pseudo-)Mersenne prime order fields
- Time-efficient finite field microarchitecture design for Curve448 and Ed448 on Cortex-M4
Uses Software
This page was built for publication: How to (pre-)compute a ladder -- improving the performance of X25519 and X448
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1746965)
