Differential cryptanalysis

About: Differential cryptanalysis is a research topic. Over the lifetime, 2131 publications have been published within this topic receiving 54681 citations.

Fast software encryption : 19th international workshop, FSE 2012, Washington, DC, USA, March 19-21, 2012 : revised selected papers

Abstract: Block ciphers.- Differential cryptanalysis.- Hash functions.- Modes of operation.- New tools for cryptanalysis.- New designs.- Keccak.

The automated cryptanalysis of substitution ciphers

Abstract: Expert systems programmed in artificial intelligence languages can break simple substitution ciphers by capturing and employing knowledge about the relative frequencies of single letters and certain combinations of letters in certain positions. These techniques can be extended to fixed-key polyalphabetic ciphers after using regression analysis to separate out the segments of text enciphered in each component alphabet.

Cryptanalysis of the bluetooth E 0 cipher ssing OBDD's

Abstract: In this paper we analyze the E0 cipher, which is the cipher used in the Bluetooth specifications. We adapted and optimized the Binary Decision Diagram attack of Krause, for the specific details of E0. Our method requires 128 known bits of the keystream in order to recover the initial value of the four LFSR's in the E0 system. We describe several variants which we built to lower the complexity of the attack. We evaluated our attack against the real (non-reduced) E0 cipher. Our best attack can recover the initial value of the four LFSR's, for the first time, with a realistic space complexity of 223 (84MB RAM), and with a time complexity of 287. This attack can be massively parallelized to lower the overall time complexity. Beyond the specifics of E0, our work describes practical experience with BDD-based cryptanalysis, which so far has mostly been a theoretical concept.

Human Behaviour Based Optimization Supported With Self-Organizing Maps for Solving the S-Box Design Problem

Abstract: The cryptanalytic resistance of modern block and stream encryption systems mainly depends on the substitution box (S-box). In this context, the problem is thus to create an S-box with higher value of nonlinearity because this property can provide some degree of protection against linear and differential cryptanalysis attacks. In this paper, we design a scheme built on a human behavior-based optimization algorithm, supported with Self-Organizing Maps to prevent premature convergence and improve the nonlinearity property in order to obtain strong $8 \times 8$ substitution boxes. The experiments are compared with S-boxes obtained using other metaheuristic algorithms such as Ant Colony Optimization, Genetic Algorithm and an approach based on chaotic functions and show that the obtained S-boxes have good cryptographic properties. The obtained S-box is investigated against standard tests such as bijectivity, nonlinearity, strict avalanche criterion, bit independence criterion, linear probability and differential probability, proving that the proposed scheme is proficient to discover a strong nonlinear component of encryption systems.

Fast correlation attacks: methods and countermeasures

Abstract: Fast correlation attacks have considerably evolved since their first appearance. They have lead to new design criteria of stream ciphers, and have found applications in other areas of communications and cryptography. In this paper, a review of the development of fast correlation attacks and their implications on the design of stream ciphers over the past two decades is given.