Reference : Automatic Search for Differential Trails in ARX Ciphers
Scientific congresses, symposiums and conference proceedings : Paper published in a book
Engineering, computing & technology : Computer science
http://hdl.handle.net/10993/17183
Automatic Search for Differential Trails in ARX Ciphers
English
Biryukov, Alex mailto [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) > ; University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT)]
Velichkov, Vesselin [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
2014
Topics in Cryptology – CT-RSA 2014 Lecture Notes in Computer Science
Springer International Publishing
8366
227-250
Yes
International
978-3-319-04851-2
Cryptographer's Track at the RSA Conference
25-02-2014
RSA Corp.
San Francisco
USA
[en] symmetric cipher ; ARX ; automatic search ; SPECK ; XTEA ; tools for cryptanalysis
[en] We propose a tool for automatic search for differential trails in ARX ciphers. By introducing the concept of a partial difference distribution table (pDDT) we extend Matsui's algorithm, originally proposed for DES-like ciphers, to the class of ARX ciphers. To the best of our knowledge this is the first application of Matsui's algorithm to ciphers that do not have S-boxes. The tool is applied to the block ciphers TEA, XTEA, SPECK and RAIDEN. For RAIDEN we find an iterative characteristic on all 32 rounds that can be used to break the full cipher using standard differential cryptanalysis. This is the first cryptanalysis of the cipher in a non-related key setting. Differential trails on 9, 10 and 13 rounds are found for SPECK32, SPECK48 and SPECK64 respectively. The 13 round trail covers half of the total number of rounds. These are the first public results on the security analysis of SPECK. For TEA multiple full (i.e. not truncated) differential trails are reported for the first time, while for XTEA we confirm the previous best known trail reported by Hong et al. We also show closed formulas for computing the exact additive differential probabilities of the left and right shift operations. The source code of the tool is publicly available as part of a larger toolkit for the analysis of ARX at the following address: https://github.com/vesselinux/yaarx .
University of Luxembourg: High Performance Computing (ULHPC)
Researchers ; Professionals ; Students
http://hdl.handle.net/10993/17183
http://github.com/vesselinux/yaarx
http://www.cryptolux.org/index.php/Block_ciphers#Tools

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Open access
automatic-search-arx-trails.pdfAuthor postprint374.44 kBView/Open

Additional material(s):

File Commentary Size Access
Open access
cryp-w03-symetric-encryption-cryptanalysis.pdfSlides1.21 MBView/Open

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.