Paper 2022/618 Original: eprint.iacr.org/2022/618 ↗
A simple proof of ARX completeness
Abstract
In the recent years there has been a growing interest in ARX ciphers thanks to their performance in low cost architectures. This work is a short and simple proof that Add, Rotate and Exclusive-OR (ARX) operations generate the permutation group S_{2^n} and it is made up by elementary arguments with minimal use of group theory.
Metadata
- Available format(s)
PDF- Category
- Foundations
- Publication info
- Preprint.
- History
- 2022-05-23: last updated
- 2022-05-23: published
- Short URL
- https://ia.cr/2022/618
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2022/618,
author = {Adriano Koleci},
title = {A simple proof of ARX completeness},
howpublished = {Cryptology {ePrint} Archive, Paper 2022/618},
year = {2022},
url = {https://eprint.iacr.org/2022/618}
}