A Scheme to resist Fast Correlation Attack for Word Oriented LFSR based Stream Cipher

by   Subrata Nandi, et al.

In LFSR-based stream ciphers, the knowledge of the feedback equation of the LFSR plays a critical role in most attacks. In word-based stream ciphers such as those in the SNOW series, even if the feedback configuration is hidden, knowing the characteristic polynomial of the state transition matrix of the LFSR enables the attacker to create a feedback equation over GF(2). This, in turn, can be used to launch fast correlation attacks. In this work, we propose a method for hiding both the feedback equation of a word-based LFSR and the characteristic polynomial of the state transition matrix. Here, we employ a z-primitive σ-LFSR whose characteristic polynomial is randomly sampled from the distribution of primitive polynomials over GF(2) of the appropriate degree. We propose an algorithm for locating z-primitive σ-LFSR configurations of a given degree. Further, an invertible matrix is generated from the key. This is then employed to generate a public parameter which is used to retrieve the feedback configuration using the key. If the key size is n- bits, the process of retrieving the feedback equation from the public parameter has a average time complexity 𝕆(2^n-1). The proposed method has been tested on SNOW 2.0 and SNOW 3G for resistance to fast correlation attacks. We have demonstrated that the security of SNOW 2.0 and SNOW 3G increases from 128 bits to 256 bits.


page 1

page 2

page 3

page 4


The application of σ-LFSR in Key-Dependent Feedback Configuration for Word-Oriented Stream Ciphers

In this paper, we propose and evaluate a method for using σ-LFSRs with k...

COZMO-A New Lightweight Stream Cipher

This paper deals with the merger of the two lightweight stream ciphers: ...

Security Analysis of WG-7 Lightweight Stream Cipher against Cube Attack

Welch–Gong (WG) is a hardware-oriented LFSR-based stream cipher. WG-7 is...

The infinity norm bounds and characteristic polynomial for high order RK matrices

This paper shows that t_m ≤𝐀_∞≤√(t_m) holds, when 𝐀∈ℝ^m × m is a Runge-K...

Design of a New Stream Cipher: PARS

In this paper, a new stream cipher is designed as a clock-controlled one...

Analysis of Y00 Protocol under Quantum Generalization of a Fast Correlation Attack: Toward Information-Theoretic Security

In our previous work, it was demonstrated that the attacker could not pi...

Lack of Unique Factorization as a Tool in Block Cipher Cryptanalysis

Linear (or differential) cryptanalysis may seem dull topics for a mathem...

Please sign up or login with your details

Forgot password? Click here to reset