Fault-based attack on Montgomery's ladder algorithm
From MaRDI portal
Recommendations
- Fault attacks on the Montgomery powering ladder
- Differential fault attack on Montgomery ladder and in the presence of scalar randomization
- Fault based attack of the Rijndael cryptosystem
- A Fault Attack on Pairing-Based Cryptography
- An Improved Fault Based Attack of the Advanced Encryption Standard
- Fault attacks on pairing-based cryptography
- Information Security and Cryptology - ICISC 2005
- Fault attacks on elliptic curve cryptosystems
- Fault attacks against RSA-CRT implementation
- Structure-based RSA fault attacks
Cites work
- scientific article; zbMATH DE number 1594291 (Why is no real title available?)
- scientific article; zbMATH DE number 2085441 (Why is no real title available?)
- scientific article; zbMATH DE number 3948147 (Why is no real title available?)
- scientific article; zbMATH DE number 1221897 (Why is no real title available?)
- scientific article; zbMATH DE number 1979271 (Why is no real title available?)
- scientific article; zbMATH DE number 1979291 (Why is no real title available?)
- scientific article; zbMATH DE number 1504820 (Why is no real title available?)
- scientific article; zbMATH DE number 1759775 (Why is no real title available?)
- scientific article; zbMATH DE number 954401 (Why is no real title available?)
- scientific article; zbMATH DE number 1878328 (Why is no real title available?)
- scientific article; zbMATH DE number 3353398 (Why is no real title available?)
- A Note on Elliptic Curves Over Finite Fields
- A method for obtaining digital signatures and public-key cryptosystems
- A public key cryptosystem and a signature scheme based on discrete logarithms
- An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
- Analysis of the GHS Weil Descent Attack on the ECDLP over Characteristic Two Finite Fields of Composite Degree
- Constructive and destructive facets of Weil descent on elliptic curves
- Efficient signature generation by smart cards
- Elliptic Curve Cryptosystems
- Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
- Elliptic curve cryptosystems in the presence of permanent and transient faults
- Evaluation of discrete logarithms in a group of 𝑝-torsion points of an elliptic curve in characteristic 𝑝
- Fast computation of canonical lifts of elliptic curves and its application to point counting.
- Improving the parallelized Pollard lambda search on anomalous binary curves
- Monte Carlo Methods for Index Computation (mod p)
- New directions in cryptography
- On the importance of eliminating errors in cryptographic computations
- Parallel collision search with cryptanalytic applications
- Reducing elliptic curve logarithms to logarithms in a finite field
- Speeding the Pollard and Elliptic Curve Methods of Factorization
- Validation of Elliptic Curve Public Keys
- Zero-knowledge proofs of identity
Cited in
(7)- Fault detection and a differential fault analysis countermeasure for the Montgomery power ladder in elliptic curve cryptography
- Information Security and Cryptology - ICISC 2005
- Fault attacks on hyperelliptic curve discrete logarithm problem over binary field
- scientific article; zbMATH DE number 1979291 (Why is no real title available?)
- Exceptional Procedure Attack on Elliptic Curve Cryptosystems
- Extended elliptic curve Montgomery ladder algorithm over binary fields with resistance to simple power analysis
- Degenerate curve attacks. Extending invalid curve attacks to Edwards curves and other models
This page was built for publication: Fault-based attack on Montgomery's ladder algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q656523)
