




























Kai Hu, Shandong University
Shuntian Jiang, Shandong University
Yanhong Fan, Shandong University
Yong Fu, Qilu University of Technology
Bart Preneel, imec-COSIC, KU Leuven
Meiqin Wang, Shandong University
Avoiding feeding forward seems to be a major goal of the sponge construction. We make a step back and investigate adding feeding forward back to sponge. The obtained sponge-with-feeding-forward construction has a number of benefits: (1) In the random permutation model, its preimage and second preimage security bounds are much better than the standard sponge with the same capacity, while collision and indifferentiability security bounds are comparable; (2) Its collision and (second) preimage security can be reduced to well-defined properties of the underlying permutation, i.e., correlation intractability w.r.t. certain family of evasive relations. We further incorporate several somewhat new ideas to form detailed hash and XOF constructions SpongeFwd: (1) Feeding-forward is only applied to the capacity part, and the final output(s) is the capacity part (with the rate part discarded). In this way, when $c$ equals the primary hash output size $h$, a single permutation-call suffices for squeezing. This also simplifies the underlying evasive relations for the reduction security proof. (2) We replace the hash IV with the first message block to have the best possible efficiency. (3) We employ a parallel structure to define an XOF variant. (4) We use HAIFI-style counter inputs to achieve both length-independent second-preimage security and domain separation for XOF. The better (second) preimage security enables constructing 512-bit output hash function from Keccak-p[800]: with 512-bit capacity, its collision and (second) preimage security bounds are the same as the standard SHA-3-512, while its hardware area is reduced by roughly 38% (according to our preliminary estimation).
Note: CRYPTO 2026 full version
BibTeX
@misc{cryptoeprint:2025/1006,
author = {Chun Guo and Kai Hu and Shuntian Jiang and Yanhong Fan and Yong Fu and Bart Preneel and Meiqin Wang},
title = {Permutation-Based Hash from Non-Idealized Assumptions: Adding Feed-Forward to Sponge},
howpublished = {Cryptology {ePrint} Archive, Paper 2025/1006},
year = {2025},
url = {https://eprint.iacr.org/2025/1006}
}
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。