Lattice attacks against elliptic-curve signatures with blinded scalar multiplication

DOI10.1007/978-3-319-69453-5_7zbMath1412.94177OpenAlexW2617398708MaRDI QIDQ1698621

Dahmun Goudarzi, Matthieu Rivain, Damien Vergnaud

Publication date: 16 February 2018

Full work available at URL: https://hal.inria.fr/hal-01379249/file/sac16.pdf

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (1)

Evaluating the Cache Side Channel Attacks Against ECDSA

Cites Work

• On Lovász' lattice reduction and the nearest lattice point problem
• Factoring polynomials with rational coefficients
• Efficient signature generation by smart cards
• The insecurity of the elliptic curve digital signature algorithm with partially known nonces
• Practical key recovery for discrete-logarithm based authentication schemes from random nonce bits
• The insecurity of the digital signature algorithm with partially known nonces
• Finding a Small Root of a Univariate Modular Equation
• Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known
• A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
• Information and Communications Security
• Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
• Attacking (EC)DSA Given Only an Implicit Hint
• Speeding the Pollard and Elliptic Curve Methods of Factorization
• Elliptic Curve Cryptosystems
• Cryptographic Hardware and Embedded Systems - CHES 2004
• Lattice attacks on digital signature schemes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Lattice attacks against elliptic-curve signatures with blinded scalar multiplication