APE: Authenticated Permutation-Based Encryption for Lightweight Cryptography

Elena Andreeva, Begül Bilgin, Andrey Bogdanov, Atul Luykx, Bart Mennink, Nicky Mouha, Kan Yasuda

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    29 Citations (Scopus)
    73 Downloads (Pure)

    Abstract

    The domain of lightweight cryptography focuses on cryptographic algorithms for extremely constrained devices. It is very costly to avoid nonce reuse in such environments, because this requires either a hardware source of randomness, or non-volatile memory to store a counter. At the same time, a lot of cryptographic schemes actually require the nonce assumption for their security. In this paper, we propose APE as the first permutation-based authenticated encryption scheme that is resistant against nonce misuse. We formally prove that APE is secure, based on the security of the underlying permutation. To decrypt, APE processes the ciphertext blocks in reverse order, and uses inverse permutation calls. APE therefore requires a permutation that is both efficient for forward and inverse calls. We instantiate APE with the permutations of three recent lightweight hash function designs: Quark, Photon, and Spongent. For any of these permutations, an implementation that sup- ports both encryption and decryption requires less than 1.9 kGE and 2.8 kGE for 80-bit and 128-bit security levels, respectively.
    Original languageEnglish
    Title of host publicationFast Software Encryption
    Subtitle of host publication21st International Workshop, FSE 2014, London, UK, March 3-5, 2014. Revised Selected Papers
    EditorsCarlos Cid, Christian Rechberger
    Place of PublicationLondon
    PublisherSpringer
    Pages168-186
    Number of pages16
    ISBN (Electronic)978-3-662-46706-0
    ISBN (Print)978-3-662-46706-0
    DOIs
    Publication statusPublished - Mar 2014
    Event21st International Workshop on Fast Software Encryption, FSE 2014 - London, United Kingdom
    Duration: 3 Mar 20145 Mar 2014
    Conference number: 21

    Publication series

    Name Lecture Notes in Computer Science
    PublisherSpringer
    Volume8540
    ISSN (Print)0302-9743
    ISSN (Electronic)1611-3349

    Workshop

    Workshop21st International Workshop on Fast Software Encryption, FSE 2014
    Abbreviated titleFSE
    CountryUnited Kingdom
    CityLondon
    Period3/03/145/03/14

    Keywords

    • SCS-Cybersecurity
    • APE
    • Authenticated encryption
    • Sponge function
    • Online
    • Deterministic
    • Permutation-based
    • Misuse resistant

    Fingerprint Dive into the research topics of 'APE: Authenticated Permutation-Based Encryption for Lightweight Cryptography'. Together they form a unique fingerprint.

  • Cite this

    Andreeva, E., Bilgin, B., Bogdanov, A., Luykx, A., Mennink, B., Mouha, N., & Yasuda, K. (2014). APE: Authenticated Permutation-Based Encryption for Lightweight Cryptography. In C. Cid, & C. Rechberger (Eds.), Fast Software Encryption: 21st International Workshop, FSE 2014, London, UK, March 3-5, 2014. Revised Selected Papers (pp. 168-186). ( Lecture Notes in Computer Science; Vol. 8540). London: Springer. https://doi.org/10.1007/978-3-662-46706-0_9