On Linear Hulls, Statistical Saturation Attacks, PRESENT and a Cryptanalysis of PUFFIN

Gregor Leander

doi:10.1007/978-3-642-20465-4_18

On Linear Hulls, Statistical Saturation Attacks, PRESENT and a Cryptanalysis of PUFFIN

Gregor Leander

Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

Abstract

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.

Original language	English
Title of host publication	Lecture Notes in Computer Science
Volume	6917
Publisher	Springer
Publication date	2011
Pages	303-322
ISBN (Print)	9783642204647
DOIs	https://doi.org/10.1007/978-3-642-20465-4_18
Publication status	Published - 2011
Event	Advances in Cryptology : 30th Annual International Conference on the Theory and Applications of Cryptographic Techniques - Tallinn, Estonia Duration: 15 May 2011 → 19 May 2011 Conference number: 30

Conference

Conference	Advances in Cryptology : 30th Annual International Conference on the Theory and Applications of Cryptographic Techniques
Number	30
Country/Territory	Estonia
City	Tallinn
Period	15/05/2011 → 19/05/2011

Access to Document

10.1007/978-3-642-20465-4_18

OpenUrl availability

Check availability in DTU Findit

Cite this

@inproceedings{349e375a129d47f5a896183c24218c82,

title = "On Linear Hulls, Statistical Saturation Attacks, PRESENT and a Cryptanalysis of PUFFIN",

abstract = "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.",

author = "Gregor Leander",

year = "2011",

doi = "10.1007/978-3-642-20465-4\_18",

language = "English",

isbn = "9783642204647",

volume = "6917",

pages = "303--322",

booktitle = "Lecture Notes in Computer Science",

publisher = "Springer",

note = "Advances in Cryptology : 30th Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2011 ; Conference date: 15-05-2011 Through 19-05-2011",

}

Leander, G 2011, On Linear Hulls, Statistical Saturation Attacks, PRESENT and a Cryptanalysis of PUFFIN. in Lecture Notes in Computer Science. vol. 6917, Springer, pp. 303-322, Advances in Cryptology : 30th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tallinn, Estonia, 15/05/2011. https://doi.org/10.1007/978-3-642-20465-4_18

TY - GEN

T1 - On Linear Hulls, Statistical Saturation Attacks, PRESENT and a Cryptanalysis of PUFFIN

AU - Leander, Gregor

N1 - Conference code: 30

PY - 2011

Y1 - 2011

N2 - 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.

AB - 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.

U2 - 10.1007/978-3-642-20465-4_18

DO - 10.1007/978-3-642-20465-4_18

M3 - Article in proceedings

SN - 9783642204647

VL - 6917

SP - 303

EP - 322

BT - Lecture Notes in Computer Science

PB - Springer

T2 - Advances in Cryptology : 30th Annual International Conference on the Theory and Applications of Cryptographic Techniques

Y2 - 15 May 2011 through 19 May 2011

ER -

On Linear Hulls, Statistical Saturation Attacks, PRESENT and a Cryptanalysis of PUFFIN

Abstract

Conference

Access to Document

OpenUrl availability

Fingerprint

Cite this