Skip to Main content Skip to Navigation
Conference papers

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

Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/hal-03045986
Contributor : André Schrottenloher <>
Submitted on : Tuesday, December 8, 2020 - 11:30:49 AM
Last modification on : Friday, December 11, 2020 - 3:08:58 AM

File

744.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-03045986, version 1

Collections

Citation

Antonio Flórez Gutiérrez, 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. ⟨hal-03045986⟩

Share

Metrics

Record views

27

Files downloads

38