Paper 2019/1319
Automatic Search for the Linear (hull) Characteristics of ARX Ciphers: Applied to SPECK, SPARX, Chaskey and CHAM-64 (Full Version)
Mingjiang Huang and Liming Wang
Abstract
Linear cryptanalysis is an important evaluation method for cryptographic primitives against key recovery attack. In this paper, we revisit the Walsh transformation for linear correlation calculation of modular addition, and an efficient algorithm is proposed to construct the input-output mask space of specified correlation weight. By filtering out the impossible large correlation weights in the first round, the search space of the first round can be substantially reduced. We introduce a new construction of combinational linear approximation table (cLAT) for modular addition with two inputs. When one input mask is fixed, another input mask and the output mask can be obtained by the \textit{Spliting-Lookup-Recombination} approach. We first split the
Note: We added references [17,18] and added the comparison of relevant results.
Metadata
- Available format(s)
-
PDF
- Category
- Secret-key cryptography
- Publication info
- Preprint. MINOR revision.
- Keywords
- SPECKSPARXChaskeyCHAMARXLinear cryptanalysisAutomatic searchBlock ciphers
- Contact author(s)
- huangmingjiang @ iie ac cn
- History
- 2020-01-08: last of 2 revisions
- 2019-11-17: received
- See all versions
- Short URL
- https://ia.cr/2019/1319
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2019/1319, author = {Mingjiang Huang and Liming Wang}, title = {Automatic Search for the Linear (hull) Characteristics of {ARX} Ciphers: Applied to {SPECK}, {SPARX}, Chaskey and {CHAM}-64 (Full Version)}, howpublished = {Cryptology {ePrint} Archive, Paper 2019/1319}, year = {2019}, url = {https://eprint.iacr.org/2019/1319} }