凹处
发表于 2025-3-26 23:48:21
Yoshiki Sawa,Imuran Memon,Hikaru Matsudafinding collisions for both. Thus, this forces a parameter blowup (i.e., efficiency loss) for reaching a certain desired level of security. We ask whether it is possible to build families of keyed hash functions which are . resistant to any non-trivial time-space tradeoff attacks for finding collisi
葡萄糖
发表于 2025-3-27 01:34:19
http://reply.papertrans.cn/15/1476/147578/147578_32.png
set598
发表于 2025-3-27 08:45:05
Finding the Impossible: Automated Search for Full Impossible-Differential, Zero-Correlation, and Int978-1-349-13095-5
FILTH
发表于 2025-3-27 10:39:43
Meet-in-the-Middle Preimage Attacks on Sponge-Based Hashing978-0-230-35504-0
翻动
发表于 2025-3-27 16:56:01
http://reply.papertrans.cn/15/1476/147578/147578_35.png
larder
发表于 2025-3-27 20:40:10
Collision Attacks on Round-Reduced SHA-3 Using Conditional Internal Differentials978-1-137-37637-4
唤醒
发表于 2025-3-27 22:12:58
http://reply.papertrans.cn/15/1476/147578/147578_37.png
装入胶囊
发表于 2025-3-28 03:20:47
Pitfalls and Shortcomings for Decompositions and Alignment978-0-230-62085-8
心胸狭窄
发表于 2025-3-28 08:10:12
http://reply.papertrans.cn/15/1476/147578/147578_39.png
束以马具
发表于 2025-3-28 13:54:53
http://reply.papertrans.cn/15/1476/147578/147578_40.png