Results 281 to 290 of about 15,368 (325)

New correlation attacks on stream ciphers

IEEE AFRICON. 6th Africon Conference in Africa,, 2003
We introduce two new correlation attacks on stream ciphers that make use of non-linearly combined linear feedback shift-registers (LFSRs). The first attack utilises the well-known Lempel-Ziv complexity measure for binary sequences. The second attack is based on the binary derivative, applied in conjunction with the distribution of runs in a binary ...
W.T. Penzhorn, C. Bruwer
openaire   +1 more source

Distinguishing Attack on SN3 Stream Cipher

2008 International Conference on Intelligent Information Hiding and Multimedia Signal Processing, 2008
SN3 is a synchronous stream cipher uses keys up to 768-byte. The cipher is constructed as an array base generator in which each key stream word can be considered as a linear combination of some array contents. While the cipher has not been analyzed yet, we show that there is a significance correlation between output key streams and by using this result
Mohammad Ali Orumiehchi, S. Fahimeh Mohebbipoor   +1 more
openaire   +1 more source

Fault Attacks on Stream Ciphers

2012
In this chapter, we provide an outlook on fault attack techniques aimed at breaking stream ciphers. The chapter will start with an overview of the possible targets for fault attacks among this class of encryption algorithms, and subsequently provide two in-depth case studies on enhancing impossible cryptanalysis against RC4 and differential ...
Alessandro Barenghi, Elena Trichina
openaire   +1 more source

Linear Attacks on Stream Ciphers

2011
This paper is a survey of how linear attacks can be applied on stream ciphers. It gives an overview of the development of linear attacks and a short theoretical explanation on how a linear attack on a stream cipher is typically launched today. The main part of the paper is then a more detailed description of the application of linear attacks on three ...
Hell Martin, Johansson Thomas
openaire   +1 more source

Correlation attacks on stream ciphers

Proceedings of IEEE. AFRICON '96, 2002
The fast correlation attack described by Meier and Staffelbach (1989) on certain classes of stream ciphers, based on linear feedback shift registers, requires that the number of taps of the characteristic polynomial must be small-typically less than 10.
openaire   +1 more source

Algebraic Attacks on Stream Ciphers with Gröbner Bases

2009
Stream ciphers efficiently encrypt data streams of arbitrary length and are widely deployed in practice, e.g., in mobile phones. Consequently, the development of new mechanisms to design and analyze stream ciphers is one of the major topics in modern cryptography.
Armknecht, Frederik, Ars, Gwénolé
openaire   +2 more sources

Fault Attacks on Stream Cipher Scream

2015
In this paper we present a differential fault attack (DFA) on the stream cipher Scream which is designed by the IBM researchers Coppersmith, Halevi, and Jutla in 2002. The known linear distinguishing attack on Scream takes 2120 output words and there is no key recovery attack on it, since the S-box used by Scream is key-dependent and complex. Under the
Shaoyu Du, Bin Zhang, Zhenqi Li, Dongdai Lin   +3 more
openaire   +1 more source