A SELF-STUDY COURSE IN BLOCK-CIPHER CRYPTANALYSIS

@article{Schneier2000ASC,
  title={A SELF-STUDY COURSE IN BLOCK-CIPHER CRYPTANALYSIS},
  author={Bruce Schneier},
  journal={Cryptologia},
  year={2000},
  volume={24},
  pages={18 - 33}
}
  • B. Schneier
  • Published 1 January 2000
  • Computer Science, Mathematics
  • Cryptologia
Studying cryptanalysis is difficult because there is no standard textbook, and no way of knowing which cryptanalytic problems are suitable for different levels of students. This paper attempts to organize the existing literature of block-cipher cryptanalysis in a way that students can use to learn cryptanalytic techniques and ways to break new algorithms. 
Using Hadamard transform for cryptanalysis of pseudo-random generators in stream ciphers
TLDR
The probability to decipher different pseudo-random number generators used as components of stream ciphers is determined and a relationship between entropy and Hadamard’s values is found.
Analysis of bitsum attack on block ciphers
TLDR
This attack is conducted in order to find a correlation between Bitsum of Plaintext, Key and Ciphertext, and the correlation between confusion and diffusion properties of the ciphers as well.
A New Type of Attacks on Block Ciphers
A new attack (called “gradient statistical”) on block ciphers is suggested and experimentally investigated. We demonstrate the possibility of applying it to ciphers for which no attacks are known
Cryptanalysis and Improvement of a Chaotic Map-Based Image Encryption System Using Both Plaintext Related Permutation and Diffusion
TLDR
This work makes detailed cryptanalysis on a published chaotic map-based image encryption system, where the encryption process is plaintext Image dependent and shows that some designing flaws make the published cryptosystem vulnerable to chosen-plaintext attack, and proposes an enhanced algorithm to overcome those flaws.
Analysis of block cipher constructions against biclique and multiset attacks
TLDR
This thesis proposes a new extension of biclique technique termed as Star based Bicliques and uses them to solve the problem of high data complexity usually associated with this technique and employs the above cryptanalytic methods to provide the best attacks on few standardized block ciphers.
A Study of Distinguisher Attack on AES-128 and AES-256 Block Ciphers through Model Based Classification Using Neural Network
TLDR
This research work has attempted to distinguish the cipher blocks of AES-128 (Advanced Encryption Standard) and AES-256 symmetric block cipher algorithms using an artificial neural network based classifier.
Differential cryptanalysis of 24-round CAST-256
  • A. Pestunov
  • Computer Science, Mathematics
    2008 IEEE Region 8 International Conference on Computational Technologies in Electrical and Electronics Engineering
  • 2008
TLDR
An attack described in this paper allows to break 24 rounds of CAST-256, but this attack works for all the keys and not only for the weak ones, less than the complexity of a brute-force attack for 256-bit keys.
Application of the distinguishing attack to lightweight block ciphers
  • B. Ryabko, A. Soskov
  • Computer Science, Mathematics
    2017 International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON)
  • 2017
TLDR
This work applied the distinguishing attack to modern lightweight block ciphers Speck, Simon, Simeck, HIGHT and LEA using statistical test “Book Stack” and found a minimal number of rounds where encrypted data looked like random bit-sequence.
The distinguishing attack on Speck, Simon, Simeck, HIGHT and LEA
TLDR
It turned out that Speck, Simon, HIGHT and LEA showed a sufficient resistance to the distinguishing attack, but Simeck with 48-bit block size and 96-bit key size was not immune to this attack.
THE EXPERIMENTAL DISTINGUISHING ATTACKS ON A NEW FAMILY OF LIGHTWEIGHT BLOCK CIPHERS “SIMECK”
TLDR
A maximum number of rounds where distinguishing attacks could be successfully applied on Simeck, a new family of lightweight block ciphers introduced in 2015, is found.
...
...

References

SHOWING 1-7 OF 7 REFERENCES
New Structure of Block Ciphers with Provable Security against Differential and Linear Cryptanalysis
  • M. Matsui
  • Computer Science, Mathematics
    FSE
  • 1996
We introduce a methodology for designing block ciphers with provable security against differential and linear cryptanalysis. It is based on three new principles: change of the location of round
The Block Cipher Square
TLDR
A new 128-bit block cipher called Square, which concentrates on the resistance against differential and linear cryptanalysis, and the publication of the resulting cipher for public scrutiny is published.
On Matsui's Linear Cryptanalysis
  • E. Biham
  • Computer Science, Mathematics
    EUROCRYPT
  • 1994
TLDR
This paper formalizes this method of cryptanalysis and shows that although in the details level this method is quite different from differential cryptanalysis, in the structural level they are very similar.
A Generalization of Linear Cryptanalysis and the Applicability of Matsui's Piling-Up Lemma
TLDR
It is argued that the ciphers IDEA and SAFER K-64 are secure against this generalization of linear cryptanalysis, and the basic attack is described and conditions for it to be successful.
New Block Encryption Algorithm MISTY
  • M. Matsui
  • Computer Science, Mathematics
    FSE
  • 1997
TLDR
The software implementation of MISTY1 with eight rounds can encrypt a data stream in CBC mode at a speed of 20Mbps and 40Mbps on Pentium/100MHz and PA-7200/120MHz, respectively.
Fast Software Encryption Functions
  • R. Merkle
  • Computer Science, Mathematics
    CRYPTO
  • 1990
TLDR
A well accepted encryption function for implementation in software is presented here - on a SUN 4/260 it can encrypt at 4 to 8 megabits per second, which will effectively reduce the cost and increase the availability of cryptographic protection.
Encryption algorithms