Publication: Research - peer-review › Article in proceedings – Annual report year: 2011
We discuss complexities of advanced linear attacks. In particular, we argue why it is often more appropriate to examine the median of the complexity than the average value. Moreover, we apply our methods to the block ciphers PUFFIN and PRESENT. For PUFFIN, a 128 bit key cipher, we present an attack which breaks the cipher for at least a quarter of the keys with a complexity less than 258. In the case of PRESENT we show that the design is sound. The design criteria are sufficient to ensure the resistance against linear attacks, taking into account the notion of linear hulls. Finally, we show that statistical saturation attacks and multi dimensional linear attacks are almost identical.
|Title of host publication||Lecture Notes in Computer Science|
|State||Published - 2011|
|Conference||Advances in Cryptology : 30th Annual International Conference on the Theory and Applications of Cryptographic Techniques|
|Period||01/01/2011 → …|
|Citations||Web of Science® Times Cited: No match on DOI|
Loading map data...