Cryptology ePrint Archive: Report 2013/791
APE: Authenticated Permutation-Based Encryption for Lightweight Cryptography
Elena Andreeva and Beg\"ul Bilgin and Andrey Bogdanov and Atul Luykx and Bart Mennink and Nicky Mouha and Kan Yasuda
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 secure pseudorandom number generator (PRNG), 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 supports both encryption and decryption requires less than 1.9~kGE and 2.8~kGE for 80-bit and 128-bit security levels, respectively.
Category / Keywords: secret-key cryptography / APE, Authenticated Encryption, Sponge Function, Online, Deterministic, Permutation-based, Misuse Resistant
Original Publication (with major differences): IACR-FSE-2014
Date: received 26 Nov 2013, last revised 14 May 2014
Contact author: ape at esat kuleuven be
Available format(s): PDF | BibTeX Citation
Note: Minor modifications.
Version: 20140514:125901 (All versions of this report)
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]