CryptoDB
New Techniques for Searching Differential Trails in Keccak
Authors: |
|
---|---|
Download: | |
Abstract: | Keccak-f is the permutation used in the NIST SHA-3 hash function standard. Inspired by the previous exhaustive differential trail search methods by Mella et al. at ToSC 2017, we introduce in this paper new algorithms to cover 3-round trail cores with propagation weight at least 53, up from the previous best weight 45. To achieve the goal, the concept of ideal improvement assumption is proposed to construct theoretical representative of subspaces so as to efficiently cover the search space of 3-round trail cores with at least one out-Kernel α state. Of particular note is that the exhaustiveness in 3-round trail core search of at least one out-Kernel α is only experimentally verified. With the knowledge of all 3-round trail cores of weight up to 53, lower bounds on 4/5/6-round trails are tightened to 56/58/108, from the previous 48/50/92, respectively. |
Video from TOSC 2020
BibTeX
@article{tosc-2020-30100, title={New Techniques for Searching Differential Trails in Keccak}, journal={IACR Transactions on Symmetric Cryptology}, publisher={Ruhr-Universität Bochum}, volume={2019, Issue 4}, pages={407-437}, url={https://tosc.iacr.org/index.php/ToSC/article/view/8470}, doi={10.13154/tosc.v2019.i4.407-437}, author={Guozhen Liu and Weidong Qiu and Yi Tu}, year=2020 }