The Doubling Attack – Why Upwards Is Better than Downwards

DOI10.1007/978-3-540-45238-6_22zbMath1274.94066OpenAlexW1532398039MaRDI QIDQ5187961

F. Valette, Pierre-Alain Fouque

Publication date: 9 March 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-45238-6_22

zbMATH Keywords

modular exponentiationscalar multiplicationDPA countermeasuresmultiple exponent single data attackSPA-based analysis

Mathematics Subject Classification ID

Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)

Related Items

Online Template Attack on ECDSA: ⋮ Efficient elliptic curve scalar multiplication algorithms resistant to power analysis ⋮ New fault attacks using Jacobi symbol and application to regular right-to-left algorithms ⋮ T_SM: Elliptic Curve Scalar Multiplication Algorithm Secure Against Single-Trace Attacks ⋮ Attacking embedded ECC implementations through CMOV side channels ⋮ Fast Point Multiplication on Elliptic Curves without Precomputation ⋮ Speeding up regular elliptic curve scalar multiplication without precomputation ⋮ Securing RSA against Fault Analysis by Double Addition Chain Exponentiation ⋮ Exponent Recoding and Regular Exponentiation Algorithms ⋮ Distinguishing Multiplications from Squaring Operations ⋮ Square Always Exponentiation ⋮ Thwarting side-channel analysis against RSA cryptosystems with additive blinding

This page was built for publication: The Doubling Attack – Why Upwards Is Better than Downwards