Paper 2024/1772
Byte-wise equal property of ARADI
Abstract
ARADI is a low-latency block cipher proposed by the NSA (National Security Agency) in 2024 for memory encryption. Bellini et al. experimentally demonstrated that in specific cubes of 5-round ARADI, the cube sums are byte-wise equal, for example, to 0x9d9dc5c5. This paper modifies the MILP-based division property algorithm to prove this and observes that the rotation amount of 8 in ARADI causes cancellations of monomials, allowing us to extend the byte-wise equal property up to 8 rounds. As a result, we obtained distinguishers for rounds 6 and 7 with lower data complexities of $2^{77}$ and $2^{112}$, respectively, compared to previous methods.
Note: The code used in the paper will be updated soon.
Metadata
- Available format(s)
-
PDF
- Category
- Secret-key cryptography
- Publication info
- Preprint.
- Keywords
- Block cipherIntegral attackAlgebraic attack
- Contact author(s)
- kin3548 @ gmail com
- History
- 2024-11-01: approved
- 2024-10-31: received
- See all versions
- Short URL
- https://ia.cr/2024/1772
- License
-
CC BY-NC
BibTeX
@misc{cryptoeprint:2024/1772,
author = {Sunyeop Kim and Insung Kim and Dongjae Lee and Deukjo Hong and Jaechul Sung and Seokhie Hong},
title = {Byte-wise equal property of {ARADI}},
howpublished = {Cryptology {ePrint} Archive, Paper 2024/1772},
year = {2024},
url = {https://eprint.iacr.org/2024/1772}
}
