Rotational Rebound Attacks on Reduced Skein

In this paper we combine two powerful methods of symmetric cryptanalysis: rotational cryptanalysis and the rebound attack. Rotational cryptanalysis was designed for the analysis of bit-oriented designs like ARX (Addition-Rotation-XOR) schemes. It has been applied to several hash functions and block...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of cryptology Ročník 27; číslo 3; s. 452 - 479
Hlavní autoři: Khovratovich, Dmitry, Nikolić, Ivica, Rechberger, Christian
Médium: Journal Article
Jazyk:angličtina
Vydáno: Boston Springer US 01.07.2014
Springer
Springer Nature B.V
Témata:
Algorithms
Applied sciences
Coding and Information Theory
Combinatorics
Communications Engineering
Complexity
Computational Mathematics and Numerical Analysis
Computer Science
Cryptography
Design
Encryption
Exact sciences and technology
Information, signal and communications theory
Networks
Permutations
Probability Theory and Stochastic Processes
Signal and communications theory
Telecommunications and information theory
Skein
SHA-3
Hash function
Rotational cryptanalysis
Distinguisher
Rebound attack
Cipher
Compression function
Private key
Block ciphering
Security of data
Cryptanalysis
Hashing
Open market
ISSN:0933-2790, 1432-1378
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In this paper we combine two powerful methods of symmetric cryptanalysis: rotational cryptanalysis and the rebound attack. Rotational cryptanalysis was designed for the analysis of bit-oriented designs like ARX (Addition-Rotation-XOR) schemes. It has been applied to several hash functions and block ciphers, including the new standard SHA-3 (Keccak). The rebound attack is a start-from-the-middle approach for finding differential paths and conforming pairs in byte-oriented designs like Substitution-Permutation networks and AES. We apply our new compositional attack to the reduced version of the hash function Skein, a finalist of the SHA-3 competition. Our attack penetrates more than two thirds of the Skein core—the cipher Threefish, and made the designers to change the submission in order to prevent it. The rebound part of our attack has been significantly enhanced to deliver results on the largest number of rounds. We also use neutral bits and message modification methods from the practice of collision search in MD5 and SHA-1 hash functions. These methods push the rotational property through more rounds than previous analysis suggested, and eventually establish a distinguishing property for the reduced Threefish cipher. We formally prove that such a property cannot be found for an ideal cipher within the complexity limits of our attack. The complexity estimates are supported by extensive experiments.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0933-2790
1432-1378
DOI:10.1007/s00145-013-9150-0