近日,密码学院在研学生韩佳栋作为第一作者撰写的论文《The m=n+1 Boundary of EME: A Splicing Distinguisher for the Unrefreshed EME-Core Extension and Its Linear-Map Generalization》被 Inscrypt 2026(International Conference on Information Security and Cryptology)接收。
该成果从代数结构上解释了 EME 的长度限制,揭示了跨越原始长度范围时直接沿用混合掩码所存在的风险,为宽分组加密模式的扩展设计与安全分析提供了理论参考。
Inscrypt 2026 于 2026 年 11 月 7 日至 9 日在中国香港举行。会上,韩佳栋代表研究团队就该项成果作了学术报告。
Abstract:EME is a parallelizable wide-block construction based on encrypt–mix–encrypt. Its security is proved for m-block messages only in the range m ≤ n, where n is the block length of the underlying block cipher. Halevi and Rogaway justified this restriction by giving a splicing distinguisher for m ≥ n + 2, but left open the first excluded length, m = n + 1. We resolve that boundary for the direct, unrefreshed EMEcore extension beyond its specified m ≤ n domain: the original formulas are applied to m = n + 1 blocks while continuing to use the same global mask. Under one fixed tweak, two encryption queries and one decryption query distinguish this extension from a random permutation. The distinguisher targets the unrefreshed extension and does not apply to EME∗ or IEEE EME2-AES as specified. The boundary attack is not a shortened form of the known zero-sum attack. At m = n + 1, the nonfirst coefficients have no nonempty zero-sum; instead, they form a basis and therefore uniquely represent the coefficient 1. Combining this representation with the special equation for the first mixed block gives the cancellation needed for a ciphertext splice. The same mechanism applies to Sarkar’s EMME framework: when multiplication by the field element x is replaced by a linear operator ψ with a degree-n minimal polynomial having nonzero constant term, the minimal-polynomial relation supplies the corresponding operator identity.
论文信息:Jiadong Han and Peng Wang. The m=n+1 Boundary of EME: A Splicing Distinguisher for the Unrefreshed EME-Core Extension and Its Linear-Map Generalization. In Information Security and Cryptology, 2027. Springer Nature, Singapore, 25–41.