Paper 2026/2886
Round-Key Equivalence and Collisions of the Revised MoFang
Abstract
The revised reference implementation of MoFang moves the S-box of the second message half to row 1, which does not eliminate the original per-round key cancellation. Collisions of this type on the original version have been independently reported2,3; this paper does not repeat those findings, and instead proves for the revised version that when the nonzero words of that half are confined to three designated positions, the full message expansion preserves the per-round cancellation, so that every input has 16 round-key-equivalent inputs. The property holds for any common chaining value and transfers to the complete behavior of the six reference variants under full padding, fixed initialization, and XOF output interfaces. Furthermore, the sufficient condition is promoted to a complete classification of the round key map: the common difference of any two equivalent inputs must belong to the original 16 period-two masks, and the equivalence class sizes can only be 1, 2, 4, or 16, with size 16 corresponding exactly to the original domain D0. For the DM variants, necessary and sufficient conditions for all nontrivial equivalence classes are given, together with an exact integer count of the covered domain (log2 ≈ 814.04647); the domain covered by equivalence classes of size at least four admits a three-state matrix counting formula. These results char acterize the equivalence of complete round-key sequences; the domain sizes do not indicate running time or security strength. The object of study is fixed to the 64-bit word model corresponding to the public submission; mathematical proofs, computer-assisted counting, and experimental verification against the reference C code are stated separately.
Metadata
- Available format(s)
-
PDF
- Category
- Attacks and cryptanalysis
- Publication info
- Preprint.
- Keywords
- MoFangmessage expansionround-key equivalence classescollisionnecessary and sufficient conditionexact counting
- Contact author(s)
-
2860467163 @ qq com
1984637692 @ qq com - History
- 2026-11-16: approved
- 2026-11-13: received
- See all versions
- Short URL
- https://ia.cr/2026/2886
- License
-
CC BY-NC-SA
BibTeX
@misc{cryptoeprint:2026/2886,
author = {Zhang zhihong and Liu fengyaxuan},
title = {Round-Key Equivalence and Collisions of the Revised {MoFang}},
howpublished = {Cryptology {ePrint} Archive, Paper 2026/2886},
year = {2026},
url = {https://eprint.iacr.org/2026/2886}
}