28 search results - page 4 / 6 » Cryptography: all-out attacks or how to attack cryptography ... |
CHES
2004
Springer
13 years 11 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...
CHES
2009
Springer
14 years 6 months ago
2009
Springer
Algebraic side-channel attacks have been recently introduced as a powerful cryptanalysis technique against block ciphers. These attacks represent both a target algorithm and its ph...
CCS
2010
ACM
13 years 6 months ago
2010
ACM
We show in this paper how several proposed Physical Unclonable Functions (PUFs) can be broken by numerical modeling attacks. Given a set of challenge-response pairs (CRPs) of a PU...
ACNS
2009
Springer
14 years 24 days ago
2009
Springer
In this paper, we present a pseudo-collision attack on the compression function of all Twister variants (224,256,384,512) with complexity of about 226.5 compression function evalua...
STOC
1998
ACM
13 years 10 months ago
1998
ACM
A commitment protocol is a fundamental cryptographic primitive used as a basic buildingblock throughoutmodern cryptography. In STOC 1991, Dolev Dwork and Naor showed that in many ...