Lattice Attacks on Digital Signature Schemes

N.A. Howgrave-Graham; N.P. Smart

doi:10.1023/A:1011214926272

Designs, Codes, and Cryptography

Paper

01 Aug 2001

Lattice Attacks on Digital Signature Schemes

View publication

Abstract

We describe a lattice attack on the Digital Signature Algorithm (DSA) when used to sign many messages, mi, under the assumption that a proportion of the bits of each of the associated ephemeral keys, yi, can be recovered by alternative techniques.

Paper

A Direct Method for Solving Linear Systems

M. Tismenetsky

International Journal of Computer Mathematics

Paper

A generic grouping algorithm and its quantitative analysis

Arnon Amir, Michael Lindenbaum

IEEE Transactions on Pattern Analysis and Machine Intelligence

Paper

Output distribution of the burrows-wheeler transform

Karthik Visweswariah, Sanjeev Kulkarni, et al.

IEEE International Symposium on Information Theory - Proceedings

Paper

Conditional generative models for learning stochastic processes

Salvatore Certo, Anh Pham, et al.

Quantum Machine Intelligence

View all publications

Abstract

Related

A Direct Method for Solving Linear Systems

A generic grouping algorithm and its quantitative analysis

Output distribution of the burrows-wheeler transform

Conditional generative models for learning stochastic processes