A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Design Strategies for ARX with Provable Bounds: Sparx and LAX
[chapter]
2016
Lecture Notes in Computer Science
We present, for the first time, a general strategy for designing ARX symmetric-key primitives with provable resistance against singletrail differential and linear cryptanalysis. The latter has been a long standing open problem in the area of ARX design. The wide trail design strategy (WTS), that is at the basis of many S-box based ciphers, including the AES, is not suitable for ARX designs due to the lack of S-boxes in the latter. In this paper we address the mentioned limitation by proposing
doi:10.1007/978-3-662-53887-6_18
fatcat:6ubu2y7ding4bb5fhd6233mja4