Highly Regular Right-to-Left Algorithms for Scalar Multiplication

DOI10.1007/978-3-540-74735-2_10zbMath1300.94062OpenAlexW1786490218MaRDI QIDQ3525058

Marc Joye

Publication date: 16 September 2008

Published in: Cryptographic Hardware and Embedded Systems - CHES 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74735-2_10

zbMATH Keywords

cryptographyexponentiationscalar multiplicationconstrained devicesimplementation attacks

Mathematics Subject Classification ID

Cryptography (94A60) Mathematical problems of computer architecture (68M07)

Related Items (10)

The soft graphic integer sub-decomposition method for elliptic scalar multiplication ⋮ A Secure and Efficient Implementation of the Quotient Digital Signature Algorithm (qDSA) ⋮ Key Bit-Dependent Attack on Protected PKC Using a Single Trace ⋮ The distributions of individual bits in the output of multiplicative operations ⋮ Horizontal collision correlation attack on elliptic curves ⋮ New fault attacks using Jacobi symbol and application to regular right-to-left algorithms ⋮ Speeding up regular elliptic curve scalar multiplication without precomputation ⋮ How to (pre-)compute a ladder -- improving the performance of X25519 and X448 ⋮ Exploiting Collisions in Addition Chain-Based Exponentiation Algorithms Using a Single Trace ⋮ High-performance Implementation of Elliptic Curve Cryptography Using Vector Instructions

This page was built for publication: Highly Regular Right-to-Left Algorithms for Scalar Multiplication