Differential fault attack on Montgomery ladder and in the presence of scalar randomization

DOI10.1007/978-3-030-92518-5_14MaRDI QIDQ6157592zbMATH OpenFDO

Authors Andy Russon

Publication date 12 May 2023

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

zbMATH Keywords

elliptic curveMontgomery ladderdifferential fault attackscalar splittingscalar blinding

Mathematics Subject Classification ID

Cryptography (94A60) Elliptic curves over local fields (11G07)

Recommendations

• Protecting ECC against fault attacks: the ring extension method revisited
• scientific article; zbMATH DE number 1759775
• Fault attacks on elliptic curve cryptosystems
• Fault detection and a differential fault analysis countermeasure for the Montgomery power ladder in elliptic curve cryptography
• Enhanced elliptic curve scalar multiplication secure against side channel attacks and safe errors

Cites work

• scientific article; zbMATH DE number 2085437 (Why is no real title available?)
• scientific article; zbMATH DE number 2085441 (Why is no real title available?)
• scientific article; zbMATH DE number 1088257 (Why is no real title available?)
• scientific article; zbMATH DE number 1979278 (Why is no real title available?)
• scientific article; zbMATH DE number 1504818 (Why is no real title available?)
• scientific article; zbMATH DE number 1759775 (Why is no real title available?)
• scientific article; zbMATH DE number 3353398 (Why is no real title available?)
• Attacking embedded ECC implementations through CMOV side channels
• Complete addition formulas for prime order elliptic curves
• Differential attacks on deterministic signatures
• Factoring polynomials with rational coefficients
• Fault attacks on the Montgomery powering ladder
• Fault detection and a differential fault analysis countermeasure for the Montgomery power ladder in elliptic curve cryptography
• Hardness of computing the most significant bits of secret keys in Diffie-Hellman and related schemes
• Information and Communications Security
• Lattice basis reduction: Improved practical algorithms and solving subset sum problems
• Monte Carlo Methods for Index Computation (mod p)
• Practical fault injection on deterministic signatures: the case of EdDSA
• Speeding the Pollard and Elliptic Curve Methods of Factorization
• The insecurity of the elliptic curve digital signature algorithm with partially known nonces
• Two lattice-based differential fault attacks against ECDSA with \(w\)NAF algorithm

Cited in

(2)

• CAPABARA: a combined attack on CAPA
• Fault-based attack on Montgomery's ladder algorithm

This page was built for publication: Differential fault attack on Montgomery ladder and in the presence of scalar randomization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6157592)