In this paper we explain this generalized technique using our new construction sp-AELM. sp-AELM is a sponge based authenticated encryption scheme that provides support for limited memory devices. We also provide its security proof for privacy and authenticity in an ideal permutation model, using a code based game playing framework. Furthermore, we also present two more variants of sp-AELM that serve the same purpose and are more efficient than sp-AELM.
The ongoing CAESAR competition has 9 submissions which are based on the Sponge construction. We apply our generalized technique of storing single intermediate state to all these submissions, to determine their suitability with a Crypto module having limited memory. Our findings show that only ASCON and one of the PRIMATE's mode(namely GIBBON) satisify the limited memory constraint using this technique, while the remaining schemes (namely, Artemia, ICEPOLE, Ketje, Keyak, NORX, $\Pi$-cipher, STRIBOB and two of the PRIMATEs mode: APE \& HANUMAN) are not suitable for this scenario directly.Category / Keywords: Authenticated encryption, CAESAR, Cryptographic module, Remote key authenticated encryption, Decrypt-then-mask protocol, Privacy, Authenticity. Original Publication (with major differences): ACISP 2015 Date: received 13 Apr 2015, last revised 21 Apr 2015 Contact author: meghaa at iiitd ac in Available format(s): PDF | BibTeX Citation Version: 20150421:094918 (All versions of this report) Short URL: ia.cr/2015/331 Discussion forum: Show discussion | Start new discussion