Mathematical attack on the Digital Signature Algorithm

Posted by drelihan on Stack Overflow See other posts from Stack Overflow or by drelihan
Published on 2010-04-01T07:36:36Z Indexed on 2010/04/01 8:33 UTC
Read the original article Hit count: 379

Filed under:
|
|
|

Does anybody know the mathematics behind an attack on DSA where modulus p has p-1 made up of only small factors. In reality, this would not happen as the key generator would guarantee that this is not so.

There is much information on the web on generating good input paramters for DSA so that it is hard to crack but no information on how you find X if modulus p has p-1 made up of only small factors.

© Stack Overflow or respective owner

Related posts about dss

Related posts about dsa