Abstract. At CRYPTO 2008 Stam [8] conjectured that if an (m+s)-bit to s-bit compression function F makes r calls to a primitive f of n-bit input, ...

In this paper we prove the general case of Stam's conjecture (also up to a constant multiplicative factor). Our result is qualitatively different from ...

This in particular shows that threshold phenomena observed in practical compression functions such as JH are, in fact, unavoidable for compression functions ...

Aug 22, 2024 · This in particular shows that threshold phenomena observed in practical compression functions such as JH are, in fact, unavoidable for ...

Stam's Conjecture and Threshold Phenomena in Collision Resistance. Proceedings of the 32nd Annual Cryptology Conference on Advances in Cryptology --- CRYPTO ...

... As a matter of fact, Stam generally conjectured that collisions can typically be found in about 2 ( −1)/( +1) queries, a bound later proven by Steinberger ...

Stam's Conjecture and Threshold Phenomena in Collision Resistance. CRYPTO 2012: 384-405. [c10]. view. electronic edition via DOI (open access); references ...

Stam's conjecture and threshold phenomena. 800 in collision resistance. In CRYPTO, volume 7417 of Lecture Notes in Computer Science, pages. 801. 384–405 ...

Jun 30, 2022 · John P. Steinberger. Stam's collision resistance conjecture. In EUROCRYPT, volume 6110 of Lecture Notes in Computer Science, pages 597-615.

... Stam's conjecture and threshold phenomena in colli- sion resistance. In: Advances in Cryptology - CRYPTO 2012. Lecture Notes in Computer. Science, vol. 7417 ...