Cryptology ePrint Archive: Report 2019/1378

Alzette: A 64-bit ARX-box

Christof Beierle and Alex Biryukov and Luan Cardoso dos Santos and Johann Großschädl and Leo Perrin and Aleksei Udovenko and Vesselin Velichkov and Qingju Wang

Abstract: S-boxes are the only source of non-linearity in many symmetric primitives. While they are often defined as being functions operating on a small space, some recent designs propose the use of much larger ones (e.g., 32 bits). In this context, an S-box is then defined as a subfunction whose cryptographic properties can be estimated precisely.

In this paper, we present a 64-bit ARX-based S-box called Alzette, which can be evaluated in constant time using only 12 instructions on modern CPUs. Its parallel application can also leverage vector (SIMD) instructions. One iteration of Alzette has differential and linear properties comparable to those of the AES S-box, while two iterations are at least as secure as the AES super S-box.

Since the state size is much larger than the typical 4 or 8 bits, the study of the relevant cryptographic properties of Alzette is not trivial.

Category / Keywords: secret-key cryptography / block ciphers, implementation

Date: received 29 Nov 2019

Contact author: sparklegrupp at googlegroups com

Available format(s): PDF | BibTeX Citation

Version: 20191201:210031 (All versions of this report)

Short URL: ia.cr/2019/1378


[ Cryptology ePrint archive ]