Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/145134
Full metadata record
DC FieldValueLanguage
dc.contributor.authorLiu, Guozhenen_US
dc.contributor.authorQiu, Weidongen_US
dc.contributor.authorTu, Yien_US
dc.date.accessioned2020-12-14T01:47:14Z-
dc.date.available2020-12-14T01:47:14Z-
dc.date.issued2020-
dc.identifier.citationLiu, 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-437en_US
dc.identifier.issn2519-173Xen_US
dc.identifier.urihttps://hdl.handle.net/10356/145134-
dc.description.abstractKeccak-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.en_US
dc.description.sponsorshipMinistry of Education (MOE)en_US
dc.description.sponsorshipNanyang Technological Universityen_US
dc.description.sponsorshipNational Research Foundation (NRF)en_US
dc.language.isoenen_US
dc.relationM4082123en_US
dc.relationM4012049en_US
dc.relationM4012153en_US
dc.relationM4020466en_US
dc.relation.ispartofIACR Transactions on Symmetric Cryptologyen_US
dc.rights© 2020 Guozhen Liu, Weidong Qiu, Yi Tu. This work is licensed under a Creative Commons Attribution 4.0 International License.en_US
dc.subjectLibrary and information science::Cryptographyen_US
dc.titleNew techniques for searching differential trails in Keccaken_US
dc.typeJournal Articleen
dc.contributor.schoolSchool of Physical and Mathematical Sciencesen_US
dc.identifier.doi10.13154/tosc.v2019.i4.407-437-
dc.description.versionPublished versionen_US
dc.identifier.issue4en_US
dc.identifier.volume2019en_US
dc.identifier.spage407en_US
dc.identifier.epage437en_US
dc.subject.keywordsSHA3en_US
dc.subject.keywordsKeccak-fen_US
dc.description.acknowledgementThe 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.en_US
item.fulltextWith Fulltext-
item.grantfulltextopen-
Appears in Collections:SPMS Journal Articles
Files in This Item:
File Description SizeFormat 
8470-Article Text-4909-2-10-20200324.pdf4.86 MBAdobe PDFThumbnail
View/Open

SCOPUSTM   
Citations 50

4
Updated on Jul 11, 2024

Web of ScienceTM
Citations 50

1
Updated on Oct 24, 2023

Page view(s)

168
Updated on Jul 17, 2024

Download(s) 50

103
Updated on Jul 17, 2024

Google ScholarTM

Check

Altmetric


Plumx

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