Search Results

Implementations of ARX ciphers are hoped to have some intrinsic side channel resilience owing to the specific choice of cipher components: modular addition (A), rotation (R) and exclusive-or (X). Previous work has contributed to this understanding by ...

A method is proposed for obtaining the lower bounds of data complexity of statistical attacks on block or stream ciphers. The method is based on the Fano inequality and, unlike the available methods, doesn't use any asymptotic relations, approximate ...

In this paper we consider a class of randomized stream ciphers based on joint employment of encryption, random coding, and error-correction coding by binary linear codes. It is shown that in this class there exist ciphers that have arbitrarily high ...

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 ...

In this paper, we present a correlation attack on Sosemanuk withcomplexity less than 2¹⁵⁰. Sosemanuk is a softwareoriented stream cipher proposed by Berbain et al. to the eSTREAMcall for stream cipher and has been selected in the finalportfolio. ...

This paper presents two key-recovery attacks against the modification of Achterbahn-128/80 proposed by the authors at SASC 2007 due to the previous attacks. The 80-bit variant, Achterbahn-80, was limited to produce at most 2⁵² bits of keystream with the ...

This paper presents two key-recovery attacks against Achterbahn- 128/80, the last version of one of the stream cipher proposals in the eSTREAM project. The attack against the 80-bit variant, Achterbahn- 80, has complexity 2⁶¹. The attack against ...

Grain [11] is a lightweight stream cipher proposed by M. Hell, T. Johansson, and W. Meier to the eSTREAM call for stream cipher proposals of the European project ECRYPT [5]. Its 160-bit internal state is divided into a LFSR and an NFSR of length 80 bits ...

A vast amount of literature on stream ciphers is directed to the cryptanalysis of LFSR-based filters and combiners, resulting in various cryptanalytic attacks. In this paper, we present a unified framework for the security of a design against these ...

The conventional summation generator (SG) has been broken in the past using a number of different methods. Recently, a modified SG was proposed by Lee and Moon to increase the resistance of such generators against these attacks. However, this paper ...

Recently, Lee and Moon proposed an improved summation generator with 2-bit memory. By adding an extra bit of memory in the nonlinear combining function, the proposed generator is claimed to be secure against correlation attacks that the original ...

Several edit probabilities and edit distances incorporating the stop/go clocking in the well-known A5-type keystream generator are proposed. Recursive algorithms for their efficient computation are derived. It is shown how the edit probabilities can be ...