On the number of special feedback configurations in linear modular systems

Krishnaswamy, Srinivasan; Pillai, Harish K.

doi:10.1016/j.sysconle.2013.12.018

Cited by 3 publications

(4 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…, and φ represents Euler's totient. This conjecture has been proved in [29]. Moreover, this inductive proof is constructive and gives an algorithm for calculating such feedback functions.…”

mentioning

confidence: 78%

“…Before proceeding to our construction of a key dependent feedback configuration, we briefly describe the algorithm given in [29] which generates feedback configurations for σ-LFSRs with a given characteristic polynomial. Given a primitive polynomial p mb (x) having degree mb, the algorithm for calculating a feedback configuration for a σ-LFSR with b minput m-output delay blocks is as follows: ).…”

Section: σ-Kdfcmentioning

confidence: 99%

“…In the following section, we shall use the algorithm given in [29] to develop a key dependent feedback configuration for the σ-LFSR.…”

mentioning

confidence: 99%

See 2 more Smart Citations

Key-Dependent Feedback Configuration Matrix of Primitive σ–LFSR and Resistance to Some Known Plaintext Attacks

et al. 2022

Self Cite

View full text Add to dashboard Cite

In this paper, we propose and evaluate a method for generating key-dependent feedback configurations (KDFC) for σ-LFSRs. σ-LFSRs with such configurations can be applied to any stream cipher that uses a word-based LFSR. Here, a configuration generation algorithm uses the secret key(K) and the Initialization Vector (IV) to generate a new feedback configuration after the initialization round. It replaces the older known feedback configuration. The keystream is generated from this new feedback configuration and the FSM part. We have mathematically analysed the feedback configurations generated by this method. As a test case, we have applied this method on SNOW 2.0 and have studied its impact on resistance to algebraic attack. Besides, as a consequence of resisting algebraic attack, SNOW 2.0 can also withstand some other attacks like Distinguishing Attack, Fast Correlation Attack, Guess and Determining Attack and Cache Timing Attack. Further, we have also tested the generated keystream for randomness and have briefly described its implementation and the challenges involved in the same.

show abstract

mentioning

confidence: 78%

Section: σ-Kdfcmentioning

confidence: 99%

See 1 more Smart Citation

Key-Dependent Feedback Configuration Matrix of Primitive σ–LFSR and Resistance to Some Known Plaintext Attacks

et al. 2022

Self Cite

View full text Add to dashboard Cite

show abstract

“…The important factor in word oriented LFSR is primitive polynomial over extension field. These papers [14][15][16] are a good source of materials to study primitive polynomials over extension field.…”

Section: Preliminariesmentioning

confidence: 99%

Recent Results on Some Word Oriented Stream Ciphers: SNOW 1.0, SNOW 2.0 and SNOW 3G

Nandi¹,

Krishnaswamy²,

Mitra³

2023

Information Security and Privacy in the Digital World - Some Selected Topics

Self Cite

View full text Add to dashboard Cite

In this chapter, we have studied three word-oriented stream ciphers SNOW 1.0, SNOW 2.0 and SNOW 3G in a detailed way. The detailed description includes the working principles of each cipher, security vulnerabilities and implementation issues. It also helps us to study the challenges in each cipher. As SNOW 3G is used as a confidentiality and integrity component in 3G, 4G and 5G communications, the after study of this article may instigate the reader to find the fixes from different cryptanalysis and also find a new suitable design in Mobile telephony security.

show abstract