Highly Regular Right-to-Left Algorithms for Scalar Multiplication
From MaRDI portal
Recommendations
- Delaying and Merging Operations in Scalar Multiplication: Applications to Curve-Based Cryptosystems
- Fast point multiplication algorithms for binary elliptic curves with and without precomputation
- SPA Resistant Left-to-Right Integer Recodings
- Speeding up regular elliptic curve scalar multiplication without precomputation
- Highly Regular m-Ary Powering Ladders
Cited in
(16)- scientific article; zbMATH DE number 7272516 (Why is no real title available?)
- New fault attacks using Jacobi symbol and application to regular right-to-left algorithms
- A new encoding algorithm for a multidimensional version of the Montgomery ladder
- How to (pre-)compute a ladder -- improving the performance of X25519 and X448
- High-performance implementation of elliptic curve cryptography using vector instructions
- SPA Resistant Left-to-Right Integer Recodings
- The distributions of individual bits in the output of multiplicative operations
- Secure Signed Radix-r Recoding Methods for Constrained-Embedded Devices
- The soft graphic integer sub-decomposition method for elliptic scalar multiplication
- Horizontal collision correlation attack on elliptic curves
- Speeding up regular elliptic curve scalar multiplication without precomputation
- Binary Kummer line
- A Secure and Efficient Implementation of the Quotient Digital Signature Algorithm (qDSA)
- A duality in space usage between left-to-right and right-to-left exponentiation
- Key Bit-Dependent Attack on Protected PKC Using a Single Trace
- Exploiting collisions in addition chain-based exponentiation algorithms using a single trace
This page was built for publication: Highly Regular Right-to-Left Algorithms for Scalar Multiplication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3525058)