Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/145134
Title: New techniques for searching differential trails in Keccak
Authors: Liu, Guozhen
Qiu, Weidong
Tu, Yi
Keywords: Library and information science::Cryptography
Issue Date: 2020
Source: 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
Project: M4082123
M4012049
M4012153
M4020466
Journal: IACR Transactions on Symmetric Cryptology
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.
URI: https://hdl.handle.net/10356/145134
ISSN: 2519-173X
DOI: 10.13154/tosc.v2019.i4.407-437
Rights: © 2020 Guozhen Liu, Weidong Qiu, Yi Tu. This work is licensed under a Creative Commons Attribution 4.0 International License.
Fulltext Permission: open
Fulltext Availability: With Fulltext
Appears in Collections:SPMS Journal Articles

Files in This Item:
File Description SizeFormat 
8470-Article Text-4909-2-10-20200324.pdf4.86 MBAdobe PDFView/Open

Page view(s)

65
Updated on Jun 25, 2022

Download(s) 50

18
Updated on Jun 25, 2022

Google ScholarTM

Check

Altmetric


Plumx

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.