Lightweight AEAD and Hashing using the Sparkle Permutation Family

  • Christof Beierle Interdisciplinary Centre for Security, Reliability and Trust (SnT) and Department of Computer Science (DCS), University of Luxembourg, Esch-sur-Alzette, Luxembourg; Ruhr University Bochum, Bochum, Germany
  • Alex Biryukov Interdisciplinary Centre for Security, Reliability and Trust (SnT) and Department of Computer Science (DCS), University of Luxembourg, Esch-sur-Alzette, Luxembourg
  • Luan Cardoso dos Santos Interdisciplinary Centre for Security, Reliability and Trust (SnT) and Department of Computer Science (DCS), University of Luxembourg, Esch-sur-Alzette, Luxembourg
  • Johann Großschädl Interdisciplinary Centre for Security, Reliability and Trust (SnT) and Department of Computer Science (DCS), University of Luxembourg, Esch-sur-Alzette, Luxembourg
  • Léo Perrin Inria, Paris, France
  • Aleksei Udovenko Interdisciplinary Centre for Security, Reliability and Trust (SnT) and Department of Computer Science (DCS), University of Luxembourg, Esch-sur-Alzette, Luxembourg
  • Vesselin Velichkov University of Edinburgh, Edinburgh, U.K
  • Qingju Wang Interdisciplinary Centre for Security, Reliability and Trust (SnT) and Department of Computer Science (DCS), University of Luxembourg, Esch-sur-Alzette, Luxembourg
Keywords: SPARKLE, NIST, Authenticated Encryption, Hash functions, Lightweight Cryptography, Long Trail Strategy

Abstract

We introduce the Sparkle family of permutations operating on 256, 384 and 512 bits. These are combined with the Beetle mode to construct a family of authenticated ciphers, Schwaemm, with security levels ranging from 120 to 250 bits. We also use them to build new sponge-based hash functions, Esch256 and Esch384. Our permutations are among those with the lowest footprint in software, without sacrificing throughput. These properties are allowed by our use of an ARX component (the Alzette S-box) as well as a carefully chosen number of rounds. The corresponding analysis is enabled by the long trail strategy which gives us the tools we need to efficiently bound the probability of all the differential and linear trails for an arbitrary number of rounds. We also present a new application of this approach where the only trails considered are those mapping the rate to the outer part of the internal state, such trails being the only relevant trails for instance in a differential collision attack. To further decrease the number of rounds without compromising security, we modify the message injection in the classical sponge construction to break the alignment between the rate and our S-box layer.

Published
2020-06-22
How to Cite
Beierle, C., Biryukov, A., Cardoso dos Santos, L., Großschädl, J., Perrin, L., Udovenko, A., Velichkov, V., & Wang, Q. (2020). Lightweight AEAD and Hashing using the Sparkle Permutation Family. IACR Transactions on Symmetric Cryptology, 2020(S1), 208-261. https://doi.org/10.13154/tosc.v2020.iS1.208-261
Section
Articles