5 search results - page 1 / 1 » Automatic Search of Attacks on Round-Reduced AES and Applica... |
CRYPTO
2011
Springer
12 years 4 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 ...
AES
2004
Springer
13 years 10 months ago
2004
Springer
In this note we study security of 128-bit key 10-round AES against the boomerang attack. We show attacks on AES reduced to 5 and 6 rounds, much faster than the exhaustive key searc...
ASIACRYPT
2006
Springer
13 years 8 months ago
2006
Springer
The most efficient collision attacks on members of the SHA family presented so far all use complex characteristics which were manually constructed by Wang et al. In this report, we...
VIROLOGY
2010
13 years 3 months ago
2010
Abstract. This paper gives an overview of our research in the automation of the process of software protection analysis. We will focus more particularly on the problem of obfuscati...
IPPS
2007
IEEE
13 years 11 months ago
2007
IEEE
In this paper, we study the problem of an optimal assignment of a tree-structured context reasoning procedure onto the computation resources in a hostsatellites configuration. The...