Paper 2026/2152

Structural Analysis of Seven Hash Functions Submitted to the NGCC

Yufei Yuan, Institute of Software Chinese Academy of Sciences, University of Chinese Academy of Sciences
Ruichen Wu, Institute of Software Chinese Academy of Sciences, University of Chinese Academy of Sciences
Shanpeng Wei, Institute of Software Chinese Academy of Sciences, University of Chinese Academy of Sciences
Junxu Shen, Institute of Software Chinese Academy of Sciences, University of Chinese Academy of Sciences
Jinpeng Liu, Institute of Software Chinese Academy of Sciences
Yixin Zhang, Institute of Software Chinese Academy of Sciences, University of Chinese Academy of Sciences
Abstract

The Institute of Commercial Cryptography Standards (ICCS) launched the Next-generation Commercial Cryptographic Algorithms Program (NGCC) and invited worldwide comments on draft submission requirements and evaluation criteria for cryptographic hash algorithms. Our analysis of seven submitted hash functions gives the following results: - Message differences that cancel in every key injection give explicit collisions for all four fixed-output variants of \textbf{MoFang} and both XOF variants at every finite output length. - Two distinct states of \textbf{Neulaser} become equal after one update, giving collisions for all three variants with the initialization used by the v2 reference and optimized implementations. - An invariant subspace of \textbf{CHIME-512} permits collision search using at most \(2^{64}\) hash evaluations when shifts act separately on 64-bit words, as in both submitted implementations. - \textbf{CHAMP}'s determinant constraint gives collision searches using at most \(2^{192}\) and \(2^{384}\) hash evaluations for its 512- and 1024-bit variants, respectively. - We exhibit explicit free-start collisions for all three \textbf{QSH} variants. In the semi-free-start setting, both messages and every tree node share one chosen complete reset. We prove upper bounds of \(2^{64},2^{128},2^{128}\) compression evaluations for finding collisions with 512-, 768-, and 1024-bit digests, respectively, plus constant preparation and finalization costs. - In both versions of \textbf{WChain}, the message expansion preserves invariant sets and admits sequences of expanded blocks with periods one, three, and six over all prescribed steps. - On a set of 256 message blocks, \textbf{Cuishen}'s message expansion acts as a cyclic shift of eight binary coordinates throughout all 64 rounds. With the same initial chaining register and counter, these blocks give XOR differences between round keys with periods dividing eight. The stated evaluation budgets for \textbf{CHIME-512} and \textbf{CHAMP} give success probabilities greater than \(0.39\).

Metadata
Available format(s)
PDF
Category
Secret-key cryptography
Publication info
Preprint.
Keywords
Hash functionsCryptanalysisCollision attacksInvariant subspacesMessage expansion
Contact author(s)
yufei2021 @ iscas ac cn
ruichen2021 @ iscas ac cn
weishanpeng2024 @ iscas ac cn
shenjunxu2024 @ iscas ac cn
liujinpeng26 @ mails ucas ac cn
zhangyixin2026 @ iscas ac cn
History
2026-09-29: last of 3 revisions
2026-09-22: received
See all versions
Short URL
https://ia.cr/2026/2152
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2026/2152,
      author = {Yufei Yuan and Ruichen Wu and Shanpeng Wei and Junxu Shen and Jinpeng Liu and Yixin Zhang},
      title = {Structural Analysis of Seven Hash Functions Submitted to the {NGCC}},
      howpublished = {Cryptology {ePrint} Archive, Paper 2026/2152},
      year = {2026},
      url = {https://eprint.iacr.org/2026/2152}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.