583 search results - page 22 / 117 » On the Complexity of Matsui's Attack |
CRYPTO
2011
Springer
12 years 7 months ago
2011
Springer
In this paper, we describe versatile and powerful algorithms for searching guess-and-determine and meet-in-the-middle attacks on byte-oriented symmetric primitives. To demonstrate ...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
In a previous paper we have suggested a number of ideas to attack circuit size complexity with cohomology. As a simple example, we take circuits that can only compute the AND of t...
NSDI
2008
13 years 9 months ago
2008
Hidden malicious circuits provide an attacker with a stealthy attack vector. As they occupy a layer below the entire software stack, malicious circuits can bypass traditional defe...
FSE
2009
Springer
14 years 7 months ago
2009
Springer
The EnRUPT hash functions were proposed by O'Neil, Nohl and Henzen [5] as candidates for the SHA-3 competition, organised by NIST [4]. The proposal contains seven concrete has...
HOST
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract—Rapid advances in integrated circuit (IC) development predicted by Moore’s Law lead to increasingly complex, hard to verify IC designs. Design insiders or adversaries ...