Attacking (EC)DSA With Partially Known Multiples of Nonces

In this paper, we improve the theoretical background of the attacks on the DSA schemes given in [1, 29], and we present some new more practical attacks. MSC 2010: 94A60, 11T71, 11Y16.

[1]  Mingjie Liu,et al.  Solving BDD by Enumeration: An Update , 2013, CT-RSA.

[2]  David Naccache,et al.  Experimenting with Faults, Lattices and the DSA , 2005, Public Key Cryptography.

[3]  Jean-Charles Faugère,et al.  Attacking (EC)DSA Given Only an Implicit Hint , 2012, Selected Areas in Cryptography.

[4]  Dimitrios Poulakis,et al.  New lattice attacks on DSA schemes , 2016, J. Math. Cryptol..

[5]  Martin Hlavác,et al.  Extended Hidden Number Problem and Its Cryptanalytic Applications , 2006, Selected Areas in Cryptography.

[6]  Konstantinos A. Draziotis,et al.  (EC)DSA lattice attacks based on Coppersmith's method , 2016, Inf. Process. Lett..

[7]  Thomas C. Hales.  Sphere packings, I , 1997, Discret. Comput. Geom..

[8]  Igor E. Shparlinski,et al.  The Insecurity of the Elliptic Curve Digital Signature Algorithm with Partially Known Nonces , 2003, Des. Codes Cryptogr..

[9]  Dimitrios Poulakis,et al.  Lattice Attacks on DSA Schemes Based on Lagrange's Algorithm , 2013, CAI.

[10]  Igor E. Shparlinski,et al.  The Insecurity of the Digital Signature Algorithm with Partially Known Nonces , 2002, Journal of Cryptology.

[11]  Damien Stehlé,et al.  Algorithms for the Shortest and Closest Lattice Vector Problems , 2011, IWCC.

[12]  Shafi Goldwasser,et al.  Complexity of lattice problems - a cryptographic perspective , 2002, The Kluwer international series in engineering and computer science.

[13]  Alfred Menezes,et al.  The Elliptic Curve Digital Signature Algorithm (ECDSA) , 2001, International Journal of Information Security.

[14]  Daniele Micciancio,et al.  A Deterministic Single Exponential Time Algorithm for Most Lattice Problems based on Voronoi Cell Computations ( Extended Abstract ) , 2009 .

[15]  Domingo Gómez-Pérez,et al.  A probabilistic analysis on a lattice attack against DSA , 2017, Designs, Codes and Cryptography.

[16]  Risto M. Hakala,et al.  Cache-Timing Template Attacks , 2009, ASIACRYPT.

[17]  M. Hellman.  The Mathematics of Public-Key Cryptography , 1979 .

[18]  Dan Boneh,et al.  Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes , 1996, CRYPTO.

[19]  M. Bellare,et al.  “Pseudo-Random” Number Generation within Cryptographic Algorithms: the DSS Case , 2021 .

[20]  Nigel P. Smart,et al.  Lattice Attacks on Digital Signature Schemes , 2001, Des. Codes Cryptogr..

[21]  Billy Bob Brumley,et al.  Remote Timing Attacks Are Still Practical , 2011, ESORICS.

[22]  Ian F. Blake,et al.  On the Security of the Digital Signature Algorithm , 2002, Des. Codes Cryptogr..

[23]  Dimitrios Poulakis,et al.  Some lattice attacks on DSA and ECDSA , 2011, Applicable Algebra in Engineering, Communication and Computing.

[24]  Damien Stehlé,et al.  Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices , 2000, ICALP.