Mind the Middle Layer: The HADES Design Strategy Revisited
Nathan Keller, Asaf Rosemarin
摘要
The HADES design strategy combines the classical SPN construction with the Partial SPN (PSPN) construction, in which at every encryption round, the non-linear layer is applied to only a part of the state. In a HADES design, a middle layer that consists of PSPN rounds is surrounded by outer layers of SPN rounds. The security arguments of HADES with respect to statistical attacks use only the SPN rounds, disregarding the PSPN rounds. This allows the designers to not pose any restriction on the MDS matrix used as the linear mixing operation.
In this paper we show that the choice of the MDS matrix significantly affects the security level provided by HADES designs. If the MDS is chosen properly, then the security level of the scheme against differential and linear attacks is significantly higher than claimed by the designers. On the other hand, weaker choices of the MDS allow for extremely large invariant subspaces that pass the entire middle layer without activating any non-linear operation (a.k.a. S-box).
We showcase our results on the Starkad and Poseidon instantiations of HADES. For Poseidon, we significantly improve the lower bounds on the number of active S-boxes with respect to both differential and linear cryptanalysis provided by the designers -- for example, from 28 to 60 active S-boxes for the t=6 variant. For Starkad, we show that the t=24 variant proposed by the designers admits an invariant subspace of a huge size of that passes any number of PSPN rounds without activating any S-box. Furthermore, we show that the problem can be fixed easily by replacing t with any value that is not divisible by four.
问问这篇 Paper
问问你的智能体。
Lune 读过与它相关的顶会 Paper,每个回答都会注明依据哪几篇。
引用它的顶会 Paper2
- Poseidon: A New Hash Function for Zero-Knowledge Proof SystemsLorenzo Grassi, Dmitry Khovratovich, Christian Rechberger, Arnab Roy 等USENIX Security 2021 · 被引用 410 次
- Reinforced Concrete: A Fast Hash Function for Verifiable ComputationLorenzo Grassi, Dmitry Khovratovich, Reinhard Lüftenegger, Christian Rechberger 等CCS 2022 · 被引用 34 次
相关 Paper
- On a Generalization of Substitution-Permutation Networks: The HADES Design StrategyLorenzo Grassi, Reinhard Lüftenegger, Christian Rechberger, Dragos Rotaru 等EUROCRYPT 2020 · 被引用 77 次
- Layout Graphs, Random Walks and the t-Wise Independence of SPN Block CiphersTianren Liu, Angelos Pelecanos, Stefano Tessaro, Vinod VaikuntanathanCRYPTO 2023 · 被引用 9 次
- A Generic Algorithm for Efficient Key Recovery in Differential Attacks - and its Associated ToolChristina Boura, Nicolas David, Patrick Derbez, Rachelle Heim Boissier 等EUROCRYPT 2024 · 被引用 11 次
- On Perfect Linear Approximations and Differentials over Two-Round SPNsChristof Beierle, Patrick Felke, Gregor Leander, Patrick Neumann 等CRYPTO 2023 · 被引用 5 次
- Probabilistic Linearization: Internal Differential Collisions in up to 6 Rounds of SHA-3Zhongyi Zhang, Chengan Hou, Meicheng LiuCRYPTO 2024 · 被引用 7 次
