Scalar recoding and regular \(2^w\)-ary right-to-left EC scalar multiplication algorithm

DOI10.1016/J.IPL.2013.02.002zbMath1358.94056OpenAlexW1973230904MaRDI QIDQ396590

Yoo-Jin Baek

Publication date: 13 August 2014

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2013.02.002

zbMATH Keywords

cryptographydifferential power attackelliptic curve cryptosystemountermeasurescalar recodingsimple power attack

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Checking before output may not be enough against fault-based cryptanalysis
• Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
• Exponent Recoding and Regular Exponentiation Algorithms
• Highly Regular m-Ary Powering Ladders
• Speeding the Pollard and Elliptic Curve Methods of Factorization
• On the Evaluation of Powers
• Advances in Cryptology – CRYPTO 2004
• Applied Cryptography and Network Security

This page was built for publication: Scalar recoding and regular \(2^w\)-ary right-to-left EC scalar multiplication algorithm