CryptoDB

Paper: Distinguishing Attack on NORX Permutation

Authors: Tao Huang , School of Physical and Mathematical Sciences Nanyang Technological University Hongjun Wu , School of Physical and Mathematical Sciences Nanyang Technological University DOI: 10.13154/tosc.v2018.i1.57-73 URL: https://tosc.iacr.org/index.php/ToSC/article/view/844 Search ePrint Search Google NORX is a permutation-based authentication scheme which is currently a third-round candidate of the ongoing CAESAR competition. The security bound of NORX is derived from the sponge construction applied to an ideal underlying permutation. In this paper, we show that the NORX core permutation is non-ideal with a new distinguishing attack. More specifically, we can distinguish NORX64 permutation with 248.5 queries and distinguish NORX32 permutation with 264.7 queries using carefully crafted differential-linear attacks. We have experimentally verified the distinguishing attack on NORX64 permutation. Although the distinguishing attacks reveal the weakness of the NORX permutation, it does not directly threat the security of the NORX authenticated encryption scheme.
BibTeX
@article{tosc-2018-28397,
title={Distinguishing Attack on NORX Permutation},
journal={IACR Trans. Symmetric Cryptol.},
publisher={Ruhr-Universität Bochum},
volume={2018, Issue 1},
pages={57-73},
url={https://tosc.iacr.org/index.php/ToSC/article/view/844},
doi={10.13154/tosc.v2018.i1.57-73},
author={Tao Huang and Hongjun Wu},
year=2018
}