conference paper
Hidden collisions on DSS
1996
The 16th Annual International Cryptology Conference, Advances in Cryptology - CRYPTO'96
We explain how to forge public parameters for the Digital Signature Standard with two known messages which always produce the same set of valid signatures (what we call a collision). This attack is thwarted by using the generation algorithm suggested in the specifications of the standard, so it proves one always need to check proper generation. We also present a similar attack when using this generation algorithm within a complexity 274, which is better than the birthday attack which seeks for collisions on the underlying hash function
Loading...
Name
Vau96c.ps
Access type
openaccess
Size
219.3 KB
Format
Postscript
Checksum (MD5)
d815430618db834b8a6caf2410c38d01