首页|Shandong University Researchers Have Provided New Data on Symmetric Cryptology ( Perfect Monomial Prediction for Modular Addition)
Shandong University Researchers Have Provided New Data on Symmetric Cryptology ( Perfect Monomial Prediction for Modular Addition)
扫码查看
点击上方二维码区域，可以放大扫码查看
原文链接
NETL
NSTL
By a News Reporter-Staff News Editor at Robotics & Machine Learning Daily News Daily News – Investigators publish new report on sy mmetric cryptology. According to news reporting out of Shandong, People’s Republ ic of China, by NewsRx editors, research stated, “Modular addition is often the most complex component of typical Addition- Rotation-XOR (ARX) ciphers, and the division property is the most effective tool for detecting integral distinguishe rs. Thus, having a precise division property model for modular addition is cruci al in the search for integral distinguishers in ARX ciphers.” The news reporters obtained a quote from the research from Shandong University: “Current division property models for modular addition either (a) express the op eration as a Boolean circuit and apply standard propagation rules for basic oper ations (COPY, XOR, AND), or (b) treat it as a sequence of smaller functions with carry bits, modeling each function individually. Both approaches were originall y proposed for the twosubset bit-based division property (2BDP), which is theore tically imprecise and may overlook some balanced bits. Recently, more precise ve rsions of the division property, such as parity sets, threesubset bit-based divi sion property without unknown subsets (3BDPwoU) or monomial prediction (MP), and algebraic transition matrices have been proposed. However, little attention has been given to modular addition within these precise models. The propagation rul e for the precise division property of a vectorial Boolean function f requires t hat u can propagate to v if and only if the monomial pu(x) appears in pv(f). Bra eken and Semaev (FSE 2005) studied the algebraic structure of modular addition a nd showed that for x y = z, the monomial pu(x)pv(y) appears in pw(z) if and only if u + v = w. Their theorem directly leads to a precise division property model for modular addition. Surprisingly, this model has not been applied in division property searches, to the best of our knowledge. In this paper, we apply Braeke n and Semaev’s theorem to search for integral distinguishers in ARX ciphers, lea ding to several new results. First, we improve the state-of-the-art integral dis tinguishers for all variants of the Speck family, significantly enhancing search efficiency for Speck-32/48/64/96 and detecting new integral distinguishers for Speck-48/64/96/128. Second, we determine the exact degrees of output bits for 7- round Speck-32 and all/16/2 output bits for 2/3/4-round Alzette for the first ti me. Third, we revisit the choice of rotation parameters in Speck instances, prov iding a criterion that enhances resistance against integral distinguishers.”
Shandong UniversityShandongPeople’s Republic of ChinaAsiaMachine LearningSymmetric Cryptology
NETL
NSTL
