583 search results - page 13 / 117 » On the Complexity of Matsui's Attack |
ASIACRYPT
2009
Springer
14 years 1 months ago
2009
Springer
In this paper we present two related-key attacks on the full AES. For AES-256 we show the first key recovery attack that works for all the keys and has 299.5 time and data complex...
IACR
2011
12 years 7 months ago
2011
Generic decoding of linear codes is the best known attack against most code-based cryptosystems. Understanding and measuring the complexity of the best decoding technique is thus n...
IACR
2011
12 years 7 months ago
2011
GOST is a well known block cipher which was developed in the Soviet Union during the 1970’s as an alternative to the US-developed DES. In spite of considerable cryptanalytic eff...
CRYPTO
2007
Springer
14 years 1 months ago
2007
Springer
To date the NTRUEncrypt security parameters have been based on the existence of two types of attack: a meet-in-the-middle attack due to Odlyzko, and a conservative extrapolation of...
IACR
2011
12 years 7 months ago
2011
The block cipher family for lightweight devices, KTANTAN, is analyzed in this paper. We propose a new cryptanalysis method which improves results of Meet-in-the-Middle attacks on K...