23 search results - page 1 / 5 » Attacking DSA Under a Repeated Bits Assumption |
CHES
2004
Springer
13 years 10 months ago
2004
Springer
We discuss how to recover the private key for DSA style signature schemes if partial information about the ephemeral keys is revealed. The partial information we examine is of a se...
JOC
2002
13 years 4 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 ...
DCC
2003
IEEE
14 years 4 months ago
2003
IEEE
Nguyen and Shparlinski recently presented 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 s...
EUROCRYPT
2004
Springer
13 years 10 months ago
2004
Springer
We describe a short signature scheme that is strongly existentially unforgeable under an adaptive chosen message attack in the standard security model. Our construction works in g...
TRUST
2009
Springer
13 years 11 months ago
2009
Springer
We discuss five attack strategies against BitLocker, which target the way BitLocker is using the TPM sealing mechanism. BitLocker is a disk encryption feature included in some ver...