Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 1,192 papers for “Differential cryptanalysis”

Differential Cryptanalysis

Henri Gilbert, Jérémy Jean · 2023

This chapter provides some general background on the cryptanalysis of iterated block ciphers and introduces the notion of distinguisher that is instrumental in most known classes of attacks on such ciphers. It presents the main notions encountered in differential cryptanalysis, for example, the notions of differential characteristic and differential, using Biham and Shamir's seminal attack against up to 15 Data Encryption Standard rounds as our main guiding thread. The chapter outlines a few examples of the possible refinements or extensions of differential cryptanalysis, in particular the differential effect and the case of truncated differential characteristics. It summarizes some of the strategies followed by block cipher designers to achieve resistance against differential cryptanalysis, in particular the wide trail strategy that represents the main design rationale behind the Advanced Encryption Standard. The chapter concludes by providing a few notes and references to some notable results related to differential cryptanalysis.

Cited by 3

Differential cryptanalysis

Josip Uršan · Repository of FERIT Osijek · 2021

U ovom diplomskom radu opisana je temeljna ideja diferencijalne kriptoanalize na općenitom primjeru. Implementirana je jednostavna, proizvoljna, 4-bitna šifra sa dvije runde, jednom S-kutijom u svakoj rundu, te jednim potključem u svakoj rundi. Za ovu šifru provedena je potrebna analiza koju zahtijeva diferencijalna kriptoanaliza, a uključuje analizu karakteristike šifre do R-1 rundi i analizu frekvencija ulaza i izlaza šifre za karakteristiku do R-1 rundi. Nakon obavljene analize implementiran je napad kojeg opisuje diferencijalna kriptoanaliza na 4-bitnu šifru. Potključevi su uspješno dohvaćeni, a nad S-kutijom su provedeni daljnji testovi kako bi se uočio utjecaj konfiguracije S-kutije na ulazno-izlazne odnose. Sav programski kod realiziran je u python programskom jeziku.

Cited by 0Open access

Differential‐Linear Cryptanalysis

Yosuke Todo · 2023

This chapter introduces differential-linear attacks, which were proposed by Langford and Hellman. Differential-linear attacks are combined attacks in the sense that two well-known attacks, that is, a differential attack and a linear attack, are successfully combined. Similarly to other attacks like differential attacks or linear attacks, additional rounds are added before and after a differential-linear distinguisher. The fast Fourier transformation is sometimes useful to improve the time complexity of the key recovery. At Eurocrypt 2019, Bar-On et al. presented the paper DLCT: A New Tool for Differential-Linear Cryptanalysis , where the issue related to the dependency between E1 and E2 and a middle layer is formally analyzed. At CRYPTO 2020, Beierle et al.proposed the paper Improved Differential-Linear Attacks with Applications to ARX Ciphers , where three techniques are introduced to improve differential-linear attacks.

Cited by 0

Impossible Differential Cryptanalysis

Christina Boura, María Naya‐Plasencia · 2023

Impossible differential cryptanalysis is a powerful family of attacks against block ciphers that was independently introduced by Knudsen and Biham et al.in the late 1990s. As in the case of most cryptanalysis techniques, an impossible differential attack is divided into two parts: a distinguisher part followed by a key-recovery step. This chapter describes the current techniques for both the distinguisher and the key recovery step. The most popular technique for finding an impossible differential distinguisher of maximal length is the miss-in-the-middle technique , first introduced in Biham et al. To decide on the efficiency of an attack, different parameters have to be accurately estimated. The chapter discusses the number of needed plaintext pairs, corresponding to the memory complexity of the attack. Impossible differential attacks give the best cryptanalysis results, or among the best ones, on several block ciphers.

Cited by 1Open access

Quantum Differential Cryptanalysis

Qing Zhou, Songfeng Lu, Zhigang Zhang et al. · arXiv (Cornell University) · 2018

In this paper, we propose a quantum version of the differential cryptanalysis which offers a quadratic speedup over the existing classical one and show the quantum circuit implementing it. The quantum differential cryptanalysis is based on the quantum minimum/maximum-finding algorithm, where the values to be compared and filtered are obtained by calling the quantum counting algorithm. Any cipher which is vulnerable to the classical differential cryptanalysis based on counting procedures can be cracked more quickly under this quantum differential attack.

Cited by 1Open access

Differential Cryptanalysis attacks

Des-like Cryptosystems, Eli Biham, Adi Shamir · 1991

The Data Encryption Standard (DES) is the best known and most widely used cryptosystem for civilian applications. It was developed at IBM and adopted by the National Buraeu of Standards in the mid 70's, and has successfully withstood all the attacks published so far in the open literature. In this paper we develop a new type of cryptanalytic attack which can break the reduced variant of DES with eight rounds in a few minutes on a PC and can break any reduced variant of DES (with up to 15 rounds) in less than 2 56 operations. The new attack can be applied to a variety of DES-like substitution/permutation cryptosystems, and demonstrates the crucial role of the (unpublished) design rules. 1 Introduction Iterated cryptosystems are a family of cryptographically strong functions based on iterating a weaker function n times. Each iteration is called a round and the cryptosystem is called an n-round cryptosystem. The round function is a function of the output of the previous round and of ...

Cited by 0

Improbable differential cryptanalysis

Cihangir Tezcan · 2013

Statistical attacks on block ciphers make use of a property of the cipher so that an event occurs with different probabilities depending on whether or not the correct key is used. For instance, differential cryptanalysis [3] and truncated differential cryptanalysis [5] consider characteristics or differentials which show that a particular output difference should be obtained with a relatively high probability when a particular input difference is used. Hence, when the correct key is used, the predicted differences occur more frequently.

Cited by 1

Differential Cryptanalysis of DES

Chryssis Georgiou · 2000

this paper we will describe DES and briefly present TDEA. Furthermore, we will describe an attack (differential cryptanalysis) that can be applied not only to DES but to many DESlike iterated cryptosystems (such as Lucifer, FEAL [12] and GDES [11]). This is a chosen plaintext attack which uses only the resultant ciphertexts. The basic tool of the attack is the ciphertext pair: a pair of ciphertexts whose plaintexts have particular differences (thus the name differential). The two plaintexts can be chosen at random, as long as they satisfy the difference condition, and the cryptanalyst does not have to know their values. The attack is statistical in nature and can fail in rare instances.

Cited by 0

Truncated Differential-Linear Cryptanalysis

He Yeping · 2000

A truncated differential-linear cryptanalysis method is proposed, which extends differential-linear method. DES (data encryption standard) algorithms of 9-ro und and 11-round were analyzed. The method was proved more convenient and widel y applicable. In DES like cipher algorithms, the fact that the order in which S -boxes were placed would affect the security of cipher was shown by the method. In this way, the truncated differential-linear method gives a criterion for or dering S-boxes optimally.

Cited by 1

Differential cryptanalysis of KHF

David M. Wagner · 2007

. Bakhtiari et al recently proposed a fast message authentication primitive called KHF. This paper shows that KHF is highly vulnerable to differential cryptanalysis: it can be broken with about 37 chosen message queries. This suggests that the KHF design should be reconsidered. 1 Introduction Recent applications in secure networking have spurred research in cryptographic primitives for message authentication. In particular, there is great demand for a high-speed MAC that can be implemented in software. In 1996, Bakhtiari, Safavi-Naini, and Pieprzyk proposed a new MAC primitive, called KHF, for fast software message authentication [BSF95]. See Section 2 for a brief description of their primitive. One of the main contributions of the KHF work is its careful attention to using Boolean functions which can be shown to have very good non-linearity, as well as other desirable theoretical properties. Nonetheless, this paper shows how to break KHF efficiently, despite its solid theoretical fo...

Cited by 1

Differential Cryptanalysis of Madryga

Ken Shirriff · 1995

: The Madryga encryption algorithm is susceptible to differential cryptanalysis. The key can be determined with about 5000 chosen plaintexts. Keywords: block code, differential cryptanalysis, Madryga Introduction This paper describes an attack on the Madryga encryption algorithm [2] that uses differential cryptanalysis [1]. This attack can determine the key with about 5000 chosen plaintexts. The Madryga encryption algorithm The Madryga encryption algorithm [2] was designed as an alternative to DES that could be effiiciently implemented in software. To meet this goal, it performs byte operations (shifts and exclusive -ors) rather than bit operations. It encrypts a block of TL bytes using a key of typically 8 bytes. The algorithm is intended to combine transposition operations (via the shifts) with translation operations (via the exclusive-or with key bytes). The algorithm consists of two nested loops; the outer loop performs eight rounds of the inner loop, which iterates a base step T...

Cited by 0

Improving Differential-Neural Cryptanalysis

Liu Zhang, Zilong Wang, Baocang Wang · IACR Communications in Cryptology · 2024

Our first objective is to enhance the capabilities of differential-neural distinguishers by applying more deep-learning techniques, focusing on handling more rounds and improving accuracy. Inspired by the Inception Block in GoogLeNet, we adopted a design that uses multiple parallel convolutional layers with varying kernel sizes before the residual block to capture multi-dimensional information. Additionally, we expanded the convolutional kernels in the residual blocks, enlarging the network's receptive field. In the case of Speck32/64, our efforts yield accuracy improvements in rounds 6, 7, and 8, enabling the successful training of a 9-round differential-neural distinguisher. As for Simon32/64, we developed a differential-neural distinguisher capable of effectively handling 12 rounds while achieving noteworthy accuracy enhancements in rounds 9, 10, and 11. Additionally, we utilized neutral bits to ensure the required data distribution for launching a successful key recovery attack when using multiple-ciphertext pairs as input for the neural network. Meanwhile, we redefined the formula for time complexity based on the differences in prediction speeds of the distinguisher between a single-core CPU and a GPU. Combining these various advancements allows us to considerably reduce the time and data complexity of key recovery attacks on 13-round Speck32/64. Furthermore, we used knowledge distillation techniques to reduce the model size, accelerating the distinguisher's prediction speed and reducing the time complexity. In particular, we achieved a successful 14-round key recovery attack by exhaustively guessing a 1-round subkey. For Simon32/64, we accomplished a 17-round key recovery attack for the first time and reduced the time complexity of the 16-round key recovery attack.

Cited by 9Open access