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

Gregor Leander

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-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 languageEnglish
    Title of host publicationLecture Notes in Computer Science
    Volume6917
    PublisherSpringer
    Publication date2011
    Pages303-322
    ISBN (Print)9783642204647
    DOIs
    Publication statusPublished - 2011
    EventAdvances in Cryptology : 30th Annual International Conference on the Theory and Applications of Cryptographic Techniques - Tallinn, Estonia
    Duration: 1 Jan 2011 → …
    Conference number: 30

    Conference

    ConferenceAdvances in Cryptology : 30th Annual International Conference on the Theory and Applications of Cryptographic Techniques
    Number30
    CityTallinn, Estonia
    Period01/01/2011 → …

    Fingerprint Dive into the research topics of 'On Linear Hulls, Statistical Saturation Attacks, PRESENT and a Cryptanalysis of PUFFIN'. Together they form a unique fingerprint.

    Cite this