Estimating the Probabilities of Low-Weight Differential and Linear Approximations on PRESENT-like Ciphers

Mohamed Ahmed Abdelraheem

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

    Abstract

    We use large but sparse correlation and transition-difference-probability submatrices to find the best linear and differential approximations respectively on PRESENT-like ciphers. This outperforms the branch and bound algorithm when the number of low-weight differential and linear characteristics grows exponentially which is the case in PRESENT-like ciphers. We found linear distinguishers on 23 rounds of the SPONGENT permutation. We also found better linear approximations on PRESENT using trails covering at most 4 active Sboxes which give us 24-round statistical saturation distinguishers which could be used to break 26 rounds of PRESENT.
    Original languageEnglish
    Title of host publicationInformation Security and Cryptology – ICISC 2012 : 15th International Conference, Seoul, Korea, November 28-30, 2012, Revised Selected Papers
    PublisherSpringer
    Publication date2012
    Pages368-382
    ISBN (Print)978-3-642-37681-8
    ISBN (Electronic)978-3-642-37682-5
    DOIs
    Publication statusPublished - 2012
    Event15th Annual International Conference on Information Security and Cryptology (ICISC 2012) - Seoul, Korea, Republic of
    Duration: 28 Nov 201230 Nov 2012
    http://www.icisc.org/

    Conference

    Conference15th Annual International Conference on Information Security and Cryptology (ICISC 2012)
    CountryKorea, Republic of
    CitySeoul
    Period28/11/201230/11/2012
    Internet address
    SeriesLecture Notes in Computer Science
    Volume7839
    ISSN0302-9743

    Fingerprint Dive into the research topics of 'Estimating the Probabilities of Low-Weight Differential and Linear Approximations on PRESENT-like Ciphers'. Together they form a unique fingerprint.

    Cite this