Zero-sum Distinguishers for Round-reduced GIMLI Permutation

Jiahao Cai, Zihao Wei, Yingjie Zhang, Siwei Sun, Lei Hu

2019

Abstract

GIMLI is a 384-bit permutation proposed by Bernstein et al. at CHES 2017. It is designed with the goal of achieving both high security and high performance across a wide range of hardware and software platforms. Since GIMLI can be used as a building block for many cryptographic schemes, it is important to understand its concrete security. To the best of our knowledge, third party cryptanalysis of GIMLI is limited. In this paper, we identify some zero-sum distinguishers for 14-round GIMLI with the inside-out technique, which are one-round longer than the integral distinguishers presented by the designers. Although we obtain improved cryptanalysis results, these zero-sum distinguishers are far from threatening the full version of GIMLI.

Paper Citation

in Harvard Style

Cai J., Wei Z., Zhang Y., Sun S. and Hu L. (2019). Zero-sum Distinguishers for Round-reduced GIMLI Permutation.In Proceedings of the 5th International Conference on Information Systems Security and Privacy - Volume 1: ICISSP, ISBN 978-989-758-359-9, pages 38-43. DOI: 10.5220/0007249000380043

in Bibtex Style

@conference{icissp19,
author={Jiahao Cai and Zihao Wei and Yingjie Zhang and Siwei Sun and Lei Hu},
title={Zero-sum Distinguishers for Round-reduced GIMLI Permutation},
booktitle={Proceedings of the 5th International Conference on Information Systems Security and Privacy - Volume 1: ICISSP,},
year={2019},
pages={38-43},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0007249000380043},
isbn={978-989-758-359-9},
}

in EndNote Style

TY - CONF

JO - Proceedings of the 5th International Conference on Information Systems Security and Privacy - Volume 1: ICISSP,
TI - Zero-sum Distinguishers for Round-reduced GIMLI Permutation
SN - 978-989-758-359-9
AU - Cai J.
AU - Wei Z.
AU - Zhang Y.
AU - Sun S.
AU - Hu L.
PY - 2019
SP - 38
EP - 43
DO - 10.5220/0007249000380043