On the security of the digital signature algorithm
type: Item
instance of: scholarly article
title: On the security of the digital signature algorithm
zbMATH Open document ID: 1018.94013
DOI: 10.1023/A:1016549024113
author: Theodoulos Garefalakis
author: Ian Blake
published in: Designs, Codes and Cryptography
publication date: 2002-08-21T00:00:00Z
review text: The authors develop a new key-recovery attack against the Digital Signature Algorithm (DSA). It is a variant of known attacks by Boneh et al. and is also based on lattice basis reduction techniques. They prove that the system will be insecure if half of the total number of bits in the secret and ephemeral keys (or in two ephemeral keys) are known provided that the unknown bits are contiguous.
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 94A62
zbMATH DE Number: 1785702
zbMATH Keywords: digital signature security
reviewed by: Michael E. Pohst
MaRDI profile type: Publication
full work available at URL: a:1016549024113
OpenAlex ID: W1506026585
description: scientific article; zbMATH DE number 1785702