Enhancing an attack to DSA schemes

DOI10.1007/978-3-030-21363-3_2MaRDI QIDQ2175403zbMATH OpenOpenAlexFDO

Authors Marios Adamoudis, Konstantinos A. Draziotis, Dimitros Poulakis

Publication date 29 April 2020

Full work available at URL https://doi.org/10.1007/978-3-030-21363-3_2

zbMATH Keywords

public key cryptographyclosest vector problemdigital signature algorithmelliptic curve digital signature algorithmLLL algorithmBabai's nearest plane algorithmBKZ algorithm

Mathematics Subject Classification ID

Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Authentication, digital signatures and secret sharing (94A62)

Cited in

(4)

• Message recovery attack on NTRU using a lattice independent from the public key
• Attacking (EC)DSA with partially known multiples of nonces
• Attacking (EC)DSA scheme with ephemeral keys sharing specific bits
• An efficient structural attack on NIST submission DAGS

This page was built for publication: Enhancing an attack to DSA schemes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2175403)