New techniques for searching differential trails in Keccak
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 previ...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Journal Article |
| Language: | English |
| Published: |
2020
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10356/145134 |
| _version_ | 1824455713853800448 |
|---|---|
| author | Liu, Guozhen Qiu, Weidong Tu, Yi |
| author2 | School of Physical and Mathematical Sciences |
| author_facet | School of Physical and Mathematical Sciences Liu, Guozhen Qiu, Weidong Tu, Yi |
| author_sort | Liu, Guozhen |
| collection | NTU |
| description | 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. |
| first_indexed | 2025-02-19T03:42:35Z |
| format | Journal Article |
| id | ntu-10356/145134 |
| institution | Nanyang Technological University |
| language | English |
| last_indexed | 2025-02-19T03:42:35Z |
| publishDate | 2020 |
| record_format | dspace |
| spelling | ntu-10356/1451342023-02-28T19:36:46Z New techniques for searching differential trails in Keccak Liu, Guozhen Qiu, Weidong Tu, Yi School of Physical and Mathematical Sciences Library and information science::Cryptography SHA3 Keccak-f 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. Ministry of Education (MOE) Nanyang Technological University National Research Foundation (NRF) Published version The first two authors are supported by the National Key Research and Development Program of China under Grand 2017YFB0802704, and the National Natural Science Foundation of China under Grand 61972249. The last author is supported by the National Research Foundation, Prime Minister’s Office, Singapore, under its Strategic Capabil- ity Research Centres Funding Initiative, Nanyang Technological University under grant M4082123, and Singapore’s Ministry of Education under grants M4012049, M4012153, and M4020466. We especially thank Prof. Guo Jian of Nanyang Technological University who offers us advice and guidance for this work. We thank Gilles Van Assche for helping us improve this paper. We also thank all the fellows and peers who give us advice, support and encouragement. 2020-12-14T01:47:14Z 2020-12-14T01:47:14Z 2020 Journal Article Liu, G., Qiu, W., & Tu, Y. (2020). New techniques for searching differential trails in Keccak. IACR Transactions on Symmetric Cryptology, 2019(4), 407-437. doi:10.13154/tosc.v2019.i4.407-437 2519-173X https://hdl.handle.net/10356/145134 10.13154/tosc.v2019.i4.407-437 4 2019 407 437 en M4082123 M4012049 M4012153 M4020466 IACR Transactions on Symmetric Cryptology © 2020 Guozhen Liu, Weidong Qiu, Yi Tu. This work is licensed under a Creative Commons Attribution 4.0 International License. application/pdf |
| spellingShingle | Library and information science::Cryptography SHA3 Keccak-f Liu, Guozhen Qiu, Weidong Tu, Yi New techniques for searching differential trails in Keccak |
| title | New techniques for searching differential trails in Keccak |
| title_full | New techniques for searching differential trails in Keccak |
| title_fullStr | New techniques for searching differential trails in Keccak |
| title_full_unstemmed | New techniques for searching differential trails in Keccak |
| title_short | New techniques for searching differential trails in Keccak |
| title_sort | new techniques for searching differential trails in keccak |
| topic | Library and information science::Cryptography SHA3 Keccak-f |
| url | https://hdl.handle.net/10356/145134 |
| work_keys_str_mv | AT liuguozhen newtechniquesforsearchingdifferentialtrailsinkeccak AT qiuweidong newtechniquesforsearchingdifferentialtrailsinkeccak AT tuyi newtechniquesforsearchingdifferentialtrailsinkeccak |