Scalar recoding and regular 2w-ary right-to-left EC scalar multiplication algorithm
From MaRDI portal
Publication:396590
DOI10.1016/J.IPL.2013.02.002zbMATH Open1358.94056OpenAlexW1973230904MaRDI QIDQ396590FDOQ396590
Authors: 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
cryptographydifferential power attackelliptic curve cryptosystemountermeasurescalar recodingsimple power attack
Cites Work
- Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems
- Title not available (Why is that?)
- Speeding the Pollard and Elliptic Curve Methods of Factorization
- Title not available (Why is that?)
- On the Evaluation of Powers
- Checking before output may not be enough against fault-based cryptanalysis
- Exponent Recoding and Regular Exponentiation Algorithms
- Highly Regular m-Ary Powering Ladders
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q396590)