BARB
发表于 2025-4-1 03:20:09
E. Mörathlision is very long (on the order of . blocks). Focusing on the task of finding . collisions, we study the complexity of finding a .-block collision for a given parameter .. We give several new attacks and limitations. Most notably, we give a new attack that results in a single-block collision and h
得体
发表于 2025-4-1 07:01:37
Günther Beckerher contribution is to suggest optimizations that can reduce memory access costs for an XL strategy on a large SM system using the Block-Wiedemann algorithm as subroutine when these costs are a concern. In a memory cost model based on [.], we show that the rectangular MinRank attack from [.] may ind