New results on Gimli: full-permutation distinguishers and improved collisions - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2020

New results on Gimli: full-permutation distinguishers and improved collisions


Gimli is a family of cryptographic primitives (both a hash function and an AEAD scheme) that has been selected for the second round of the NIST competition for standardizing new lightweight designs. The candidate Gimli is based on the permutation Gimli, which was presented at CHES 2017. In this paper, we study the security of both the permutation and the constructions that are based on it. We exploit the slow diffusion in Gimli and its internal symmetries to build, for the first time, a distinguisher on the full permutation of complexity 2 64. We also provide a practical distinguisher on 23 out of the full 24 rounds of Gimli that has been implemented. Next, we give (full state) collision and semi-free-start collision attacks on Gimli-Hash, reaching respectively up to 12 and 18 rounds. On the practical side, we compute a collision on 8-round Gimli-Hash. In the quantum setting, these attacks reach 2 more rounds. Finally, we perform the first study of linear trails in the permutation, and we propose differential-linear cryptanalysis that reach up to 17 rounds of Gimli.
Fichier principal
Vignette du fichier
744.pdf (668.7 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03045986 , version 1 (08-12-2020)



Antonio Florez-Gutierrez, Gaëtan Leurent, María Naya-Plasencia, Léo Perrin, André Schrottenloher, et al.. New results on Gimli: full-permutation distinguishers and improved collisions. Asiacrypt 2020 - 26th Annual International Conference on the Theory and Application of Cryptology and Information Security, Dec 2020, Daejeon / Virtual, South Korea. pp.33--63, ⟨10.1007/978-3-030-64837-4_2⟩. ⟨hal-03045986⟩


86 View
336 Download



Gmail Facebook X LinkedIn More