PRIMATEs v2.0

Elena Andreeva (1) , Begül Bilgin (2, 1) , Andrey Bogdanov (3) , Atul Luykx (1) , Florian Mendel (4) , Bart Mennink (1) , Nicky Mouha (1, 5) , Qingju Wang (6, 1) , Kan Yasuda (7)

1 ESAT-COSIC - Computer Security and Industrial Cryptography [KU Leuven]
2 EEMCS - Faculty of Electrical Engineering, Mathematics and Computer Science [Twente]
3 DTU Compute - Department of Applied Mathematics and Computer Science [Lyngby]
4 IAIK - Institute of Applied Information Processing and Communications [Graz]
5 SECRET - Security, Cryptology and Transmissions
6 Department of Computer Science
7 NTT Secure Platform Laboratories [Tokyo]

PRIMATEs are a family of permutation-based authenticated encryption algorithms for lightweight applications. They are currently under submission to the CAESAR competition. There are three PRIMATEs: the basic SpongeWrap-variant HANUMAN, GIBBON for speed-critical applications, and APE for additional security when nonces are reused or unverified plaintext is released. When resistance against hardware side-channel attacks is required, the PRIMATEs permutation has been designed to offer an efficient threshold implementation to counter first-order DPA attacks, based on glitch-free secret-sharing-based masking.

Domaines: Informatique [cs]; Cryptographie et sécurité [cs.CR]

Elena Andreeva, Begül Bilgin, Andrey Bogdanov, Atul Luykx, Florian Mendel, et al.. PRIMATEs v2.0. DIAC 2015 - Directions in Authenticated Ciphers, Sep 2015, Singapore, Singapore. ⟨hal-01241081⟩