Attacking (EC)DSA Given Only an Implicit Hint

DOI10.1007/978-3-642-35999-6_17zbMath1327.94043OpenAlexW940457550MaRDI QIDQ3455504

Guénaël Renault, Christopher Goyet, Jean-Charles Faugère

Publication date: 4 December 2015

Published in: Selected Areas in Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-35999-6_17

zbMATH Keywords

lattice attackoracleDLPECDSAimplicit information

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (6)

New lattice attacks on DSA schemes ⋮ Cryptanalysis of a public key cryptosystem based on Diophantine equations via weighted LLL reduction ⋮ Lattice-based fault attacks on deterministic signature schemes of ECDSA and EdDSA ⋮ Lattice attacks against elliptic-curve signatures with blinded scalar multiplication ⋮ Применение теории решеток к анализу схем цифровой подписи ⋮ A probabilistic analysis on a lattice attack against DSA

Cites Work

• The development of the number field sieve
• A modification of the LLL reduction algorithm
• Factoring integers with elliptic curves
• Factoring polynomials with rational coefficients
• The Magma algebra system. I: The user language
• The insecurity of the elliptic curve digital signature algorithm with partially known nonces
• A subexponential algorithm for discrete logarithms over hyperelliptic curves of large genus over \(\text{GF}(q)\)
• The insecurity of the digital signature algorithm with partially known nonces
• Further results on implicit factoring in polynomial time
• A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
• Implicit Factoring with Shared Most Significant and Middle Bits
• Implicit Factoring: On Polynomial Time Factoring Given Only an Implicit Hint
• Floating-Point LLL Revisited
• Lattice attacks on digital signature schemes

This page was built for publication: Attacking (EC)DSA Given Only an Implicit Hint