How to (pre-)compute a ladder -- improving the performance of X25519 and X448
From MaRDI portal
(Redirected from Publication:1746965)
Recommendations
Cites work
- scientific article; zbMATH DE number 3948147 (Why is no real title available?)
- scientific article; zbMATH DE number 1418307 (Why is no real title available?)
- Elliptic Curve Cryptosystems
- Fast implementation of Curve25519 using AVX2
- Fast multi-precision multiplication for public-key cryptography on embedded microprocessors
- Fast point multiplication algorithms for binary elliptic curves with and without precomputation
- Four\(\mathbb {Q}\): four-dimensional decompositions on a \(\mathbb {Q}\)-curve over the Mersenne prime
- High-speed high-security signatures
- Highly Regular Right-to-Left Algorithms for Scalar Multiplication
- Montgomery Curves and the Montgomery Ladder
- New directions in cryptography
- Public Key Cryptography - PKC 2006
- Sandy2x: new Curve25519 speed records
- Speeding the Pollard and Elliptic Curve Methods of Factorization
- The Magma algebra system. I: The user language
- Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems
Cited in
(7)- Kummer versus Montgomery Face-off over Prime Order Fields
- Binary Kummer line
- Efficient arithmetic in (pseudo-)Mersenne prime order fields
- The complete cost of cofactor \(h=1\)
- High-performance implementation of elliptic curve cryptography using vector instructions
- A Secure and Efficient Implementation of the Quotient Digital Signature Algorithm (qDSA)
- Time-efficient finite field microarchitecture design for Curve448 and Ed448 on Cortex-M4
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)