2 search results - page 1 / 1 » Solving Hidden Number Problem with One Bit Oracle and Advice |
CRYPTO
2009
Springer
14 years 8 hour ago
2009
Springer
In the Hidden Number Problem (HNP), the goal is to find a hidden number s, when given p, g and access to an oracle that on query a returns the k most significant bits of s · ga ...
JOC
2002
13 years 5 months ago
2002
We present a polynomial-time algorithm that provably recovers the signer's secret DSA key when a few bits of the random nonces k (used at each signature generation) are known ...