Publication at Faculty of Mathematics and Physics |
2007
Abstract
An extended version of the Hidden Number Problem is formulated and apllied to cryptanalysis of DSA algorithm. It enables to recover the secret key from as few as six authentications to the server.