Elliptic curve cryptosystems in the presence of permanent and transient faults
DOI10.1007/S10623-003-1160-8zbMATH Open1077.94012OpenAlexW2057209427MaRDI QIDQ2486874FDOQ2486874
Authors: Mathieu Ciet, Marc Joye
Publication date: 17 August 2005
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-003-1160-8
Recommendations
- Fault attacks on elliptic curve cryptosystems
- scientific article; zbMATH DE number 1759775
- On countermeasures against fault attacks on elliptic curve cryptography using fault detection
- Elliptic Curve Cryptosystems
- Bit-flip faults on elliptic curve base fields, revisited
- Secure and compact elliptic curve cryptosystems
- Secure elliptic curves and their performance
- Elliptic curve cryptosystems and their implementation
- Efficient elliptic curve cryptosystems
- Elliptic and hyperelliptic curves: a practical security analysis
Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Cites Work
- Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems
- A public key cryptosystem and a signature scheme based on discrete logarithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the importance of eliminating errors in cryptographic computations
- Title not available (Why is that?)
- Title not available (Why is that?)
- Reducing elliptic curve logarithms to logarithms in a finite field
- Kangaroos, monopoly and discrete logarithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Constructive and destructive facets of Weil descent on elliptic curves
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (22)
- Validation of Elliptic Curve Public Keys
- Fault attacks on elliptic curve cryptosystems
- Title not available (Why is that?)
- Analysis of the fault attack ECDLP over prime field
- Common points on elliptic curves: the achilles' heel of fault attack countermeasures
- Towards practical key exchange from ordinary isogeny graphs
- Differential fault analysis of AES: toward reducing number of faults
- Quantum lattice enumeration and tweaking discrete pruning
- Protecting ECC against fault attacks: the ring extension method revisited
- Fault detection and a differential fault analysis countermeasure for the Montgomery power ladder in elliptic curve cryptography
- Partially Known Nonces and Fault Injection Attacks on SM2 Signature Algorithm
- Montgomery Residue Representation Fault-Tolerant Computation in GF(2 k )
- On the Security of Supersingular Isogeny Cryptosystems
- Fault attacks on hyperelliptic curve discrete logarithm problem over binary field
- All shall FA-LLL: breaking CT-RSA 2022 and CHES 2022 infective countermeasures with lattice-based fault attacks
- Horizontal collision correlation attack on elliptic curves
- Bit-flip faults on elliptic curve base fields, revisited
- Fault-based attack on Montgomery's ladder algorithm
- Practical realisation and elimination of an ECC-related software bug attack
- General Fault Attacks on Multivariate Public Key Cryptosystems
- Lattice-based fault attacks against ECMQV
- Fault Attacks on Public Key Elements: Application to DLP-Based Schemes
This page was built for publication: Elliptic curve cryptosystems in the presence of permanent and transient faults
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2486874)