Paper 2022/618

A simple proof of ARX completeness

Adriano Koleci

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. MINOR revision.
Keywords
arxproofcompletenesscryptanalysis
Contact author(s)
adriano koleci 97 @ gmail com
History
2022-05-23: received
Short URL
https://ia.cr/2022/618
License
Creative Commons Attribution
CC BY

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}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.