On the security of the digital signature algorithm (Q1611356): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1023/a:1016549024113 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1506026585 / rank | |||
Normal rank |
Latest revision as of 08:38, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the security of the digital signature algorithm |
scientific article |
Statements
On the security of the digital signature algorithm (English)
0 references
21 August 2002
0 references
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.
0 references
digital signature security
0 references