Fault-based attack on Montgomery's ladder algorithm
type: Item
instance of: scholarly article
title: Fault-based attack on Montgomery's ladder algorithm
zbMATH Open document ID: 1251.94026
author: Agustin Dominguez-Oviedo
author: Bijan Ansari
author: M. Anwar Hasan
published in: Journal of Cryptology
publication date: 2012-01-18T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 11T71
Mathematics Subject Classification ID: 14G50
zbMATH DE Number: 5998588
zbMATH Keywords: elliptic curve cryptography
zbMATH Keywords: scalar multiplication
zbMATH Keywords: Montgomery ladder
zbMATH Keywords: fault-based attacks
zbMATH Keywords: invalid-curve attacks
MaRDI profile type: Publication
full work available at URL: s00145-010-9087-5
OpenAlex ID: W2069859460
cites work: Validation of Elliptic Curve Public Keys
cites work: Q4536798
cites work: On the importance of eliminating errors in cryptographic computations
cites work: Q3043950
cites work: Elliptic curve cryptosystems in the presence of permanent and transient faults
cites work: New directions in cryptography
cites work: A public key cryptosystem and a signature scheme based on discrete logarithms
cites work: Zero-knowledge proofs of identity
cites work: Q2712108
cites work: Improving the parallelized Pollard lambda search on anomalous binary curves
cites work: Constructive and destructive facets of Weil descent on elliptic curves
cites work: Q4425714
cites work: Elliptic Curve Cryptosystems
cites work: Q4502798
cites work: Analysis of the GHS Weil Descent Attack on the ECDLP over Characteristic Two Finite Fields of Composite Degree
cites work: Reducing elliptic curve logarithms to logarithms in a finite field
cites work: Q4718481
cites work: Q3718617
cites work: Speeding the Pollard and Elliptic Curve Methods of Factorization
cites work: Q4797790
cites work: An improved algorithm for computing logarithms over&lt;tex&gt;GF(p)&lt;/tex&gt;and its cryptographic significance (Corresp.)
cites work: Monte Carlo Methods for Index Computation (mod p)
cites work: A method for obtaining digital signatures and public-key cryptosystems
cites work: A Note on Elliptic Curves Over Finite Fields
cites work: Q4217446
cites work: Fast computation of canonical lifts of elliptic curves and its application to point counting.
cites work: Efficient signature generation by smart cards
cites work: Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
cites work: Evaluation of discrete logarithms in a group of 𝑝-torsion points of an elliptic curve in characteristic 𝑝
cites work: Q5628224
cites work: Q4425683
cites work: Parallel collision search with cryptanalytic applications
DOI: 10.1007/S00145-010-9087-5
Recommended article: Fault Attacks on the Montgomery Powering Ladder
Recommended article: Differential fault attack on Montgomery ladder and in the presence of scalar randomization
Recommended article: Fault based attack of the Rijndael cryptosystem
Recommended article: A Fault Attack on Pairing-Based Cryptography
Recommended article: An Improved Fault Based Attack of the Advanced Encryption Standard
Recommended article: Fault Attacks on Pairing-Based Cryptography
Recommended article: Information Security and Cryptology - ICISC 2005
Recommended article: Fault Attacks on Elliptic Curve Cryptosystems
Recommended article: Fault Attacks Against RSA-CRT Implementation
Recommended article: Structure-Based RSA Fault Attacks
description: scientific article; zbMATH DE number 5998588