Paper 2019/374

Probability 1 Iterated Differential in the SNEIK Permutation

Léo Perrin

Abstract

SNEIK is a permutation at the core of a submission to the NIST lightweight cryptography project. In this note, we exhibit an iterated probability 1 differential in this permutation. However, it is still unclear if this differential can be used to construct attacks against the permutation in a mode, e.g., against the hash function SNEIKHA. We also suggest a simple fix: adding a 32-bit rotation in one tap prevents this issue.