scispace - formally typeset
Search or ask a question
Topic

Differential cryptanalysis

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


Papers
More filters
Posted Content
TL;DR: In this paper, the authors presented an in-depth complexity analysis of the LBlock algorithm with respect to impossible differential attacks and obtained a single-key algorithm with time complexity of only 2.75 rounds and data complexity of 2.59 rounds.
Abstract: Impossible differential attacks are among the most powerful forms of cryptanalysis against block ciphers. We present in this paper an in-depth complexity analysis of these attacks. We show an unified way to mount such attacks and provide generic formulas for estimating their time, data and memory complexities. LBlock is a well studied lightweight block cipher with respect to impossible differential attacks. While previous single-key cryptanalysis reached up to 22 rounds, by applying our method we are able to break 23 rounds with time complexity $2^{75.36}$ and data complexity $2^{59}$. Other time/data trade-offs are equally possible. This is to our knowledge the best (non-exhaustive search like) cryptanalysis of this function in the single-key model.

19 citations

Proceedings ArticleDOI
22 Apr 2001
TL;DR: It is concluded that, although it can take significantly longer to resynchronize, SCFB mode can be used to provide self-synchronizing implementations for stream ciphers that are much more efficient than conventionalCFB mode and that have error propagation characteristics similar to CFB mode.
Abstract: In this paper, we examine a recently proposed mode of operation for block ciphers which we refer to as statistical cipher feedback (SCFB) mode. SCFB mode configures the block cipher as a keystream generator for use in a stream cipher such that it has the property of statistical self-synchronization, thereby allowing the stream cipher to recover from slips in the communications channel. Statistical self-synchronization involves feeding back ciphertext to the input of the keystream generator similar to the conventional cipher feedback (CFB) mode of block ciphers, except that the feedback only occurs when a special pattern is recognized in the ciphertext. In the paper, we examine the efficiency, resynchronization, and error propagation characteristics of SCFB and compare these to the conventional modes of CFB, output feedback (OFB), and counter mode. In particular, we study these characteristics of SCFB as a function of the synchronization pattern size. We conclude that, although it can take significantly longer to resynchronize, SCFB mode can be used to provide self-synchronizing implementations for stream ciphers that are much more efficient than conventional CFB mode and that have error propagation characteristics similar to CFB mode.

19 citations

Posted Content
TL;DR: This paper presents the first single-key attack on full SQUARE, an 8-round substitution-permutation block cipher, and introduces a biclique for 3 rounds of SQUARE using the independent related-key differentials.
Abstract: SQUARE, an 8-round substitution-permutation block cipher, is considered as the predecessor of the AES. In this paper, inspired from the recent biclique attack on the AES [5], we present the first single-key attack on full SQUARE. First, we introduce a biclique for 3 rounds of SQUARE using the independent related-key differentials. Then, we present an attack on the full round of this cipher with a data complexity of about 2 chosen plaintexts and a time complexity of about 2 encryptions.

19 citations

Proceedings ArticleDOI
06 Nov 2014
TL;DR: The results show that, even with a small amount of samples, the neural network was able to map the relation between inputs, keys and outputs and to obtain the correct values for the key bits k0, k1 and k4.
Abstract: In this work we show the application of a neural cryptanalysis approach to S-DES input-output-key data to test if it is capable of mapping the relations among these elements. The results show that, even with a small amount of samples (about 0,8% of all data), the neural network was able to map the relation between inputs, keys and outputs and to obtain the correct values for the key bits k 0 , k 1 and k 4 . By applying differential cryptanalysis techniques on the key space, it was possible to show that there is an explanation about the neural network partial success with some key bits. After implementing new s-boxes, which are more resistant to the differential attack, the neural network was not able to point out bits of the key any more. We believe that this new methodology of attack and repair assessment using neural networks has the potential to contribute in the future analysis of other cryptographic algorithms.

19 citations

Book ChapterDOI
17 Aug 2000
TL;DR: In this article, the authors show how a well-balanced trade-off between a generic workstation and dumb but fast reconfigurable hardware can lead to a more efficient implementation of a cryptanalysis than a full hardware or a full software implementation.
Abstract: This paper shows how a well-balanced trade-off between a generic workstation and dumb but fast reconfigurable hardware can lead to a more efficient implementation of a cryptanalysis than a full hardware or a full software implementation. A realistic cryptanalysis of the A5/1 GSM stream cipher is presented as an illustration of such trade-off. We mention that our cryptanalysis requires only a minimal amount of cipher output and cannot be compared to the attack recently announced by Alex Biryukov, Adi Shamir and David Wagner[2].

19 citations


Network Information
Related Topics (5)
Cryptography
37.3K papers, 854.5K citations
93% related
Encryption
98.3K papers, 1.4M citations
90% related
Public-key cryptography
27.2K papers, 547.7K citations
89% related
Hash function
31.5K papers, 538.5K citations
88% related
Key (cryptography)
60.1K papers, 659.3K citations
85% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202337
202271
202133
202053
201942
201850