Book ChapterDOI
Conditional Differential Cryptanalysis of Grain-128a
Michael Lehmann,Willi Meier +1 more
- pp 1-11
Reads0
Chats0
TLDR
The comparison of symbolic expressions suggests that Grain-128a is immune against dynamic cube attacks and also immune against differential attacks as the best attack could find results in a bias at round 189 out of 256.Abstract:
Grain-128a is a new version of the stream cipher Grain-128. To analyse the security of the cipher, we study the monomial structure and use high order differential attacks on both the new and old versions. The comparison of symbolic expressions suggests that Grain-128a is immune against dynamic cube attacks. Additionally, we find that it is also immune against differential attacks as the best attack we could find results in a bias at round 189 out of 256.read more
Citations
More filters
Book ChapterDOI
Automatic Security Evaluation and (Related-key) Differential Characteristic Search: Application to SIMON, PRESENT, LBlock, DES(L) and Other Bit-Oriented Block Ciphers
TL;DR: An automatic method for evaluating the security of bit-oriented block ciphers against the (related-key) differential attack with several techniques for obtaining tighter security bounds, and a new tool for finding ( related-keys) differential characteristics automatically for bit- oriented block c iphers are proposed.
Journal Article
Cube Attacks on Non-Blackbox Polynomials Based on Division Property.
TL;DR: The new cube attack to Trivium, Grain128a, ACORN and Kreyvium is applied, and these attacks are the current best key-recovery attack against these ciphers.
Book ChapterDOI
Cube Attacks on Non-Blackbox Polynomials Based on Division Property
TL;DR: The cube attack is a powerful cryptanalytic technique and is especially powerful against stream ciphers as discussed by the authors, but it cannot evaluate the security when the size of cube exceeds an experimental range, e.g., 40.
Book ChapterDOI
Improved Division Property Based Cube Attacks Exploiting Algebraic Properties of Superpoly
Qingju Wang,Qingju Wang,Qingju Wang,Yonglin Hao,Yosuke Todo,Chaoyun Li,Takanori Isobe,Willi Meier +7 more
TL;DR: The cube attack is an important technique for the cryptanalysis of symmetric key primitives, especially for stream ciphers, but for a long time after its proposal, the size of the cubes has been largely confined to an experimental range, e.g., typically 40.
Book ChapterDOI
Fast Correlation Attack Revisited
TL;DR: This paper revisits the fast correlation attack from a new point of view based on a finite field, and it brings a new property for the FCA when there are multiple linear approximations, and proposes a novel algorithm based on the new property, which enables us to reduce both time and data complexities.
References
More filters
Book ChapterDOI
Finding collisions in the full SHA-1
TL;DR: This is the first attack on the full 80-step SHA-1 with complexity less than the 280 theoretical bound, and it is shown that collisions ofSHA-1 can be found with complexityLess than 269 hash operations.
Book ChapterDOI
How to break MD5 and other hash functions
Xiaoyun Wang,Hongbo Yu +1 more
TL;DR: A new powerful attack on MD5 is presented, which unlike most differential attacks, does not use the exclusive-or as a measure of difference, but instead uses modular integer subtraction as the measure.
Book
Fast Software Encryption
TL;DR: Simplified variants that omit a quadratic function and a fixed rotation in RC6 are examined to clarify their essential contribution to the overall security of RC6.
Book ChapterDOI
Polynomial reconstruction based cryptography
Aggelos Kiayias,Moti Yung +1 more
TL;DR: A short overview of recent works on the problem of Decoding Reed Solomon Codes (aka Polynomial Reconstruction) and the novel applications that were enabled due to this development.