Nonsingularity of Trivium-like cascade FSRs over finite fields via semi-tensor product

In stream cipher designing, nonsingularity is a crucial requirement to ensure that the feedback shift registers (FSRs) do not produce keys that are equivalent to one another. This study uses a semi-tensor product to examine the nonsingularity of Trivium-like cascade FSRs over a finite field. The Tri...

Full description

Saved in:
Bibliographic Details
Published inInternational journal of control Vol. 97; no. 3; pp. 589 - 599
Main Authors Gao, Zhe, Feng, Jun-e
Format Journal Article
LanguageEnglish
Published Abingdon Taylor & Francis 03.03.2024
Taylor & Francis Ltd
Subjects
Algorithms
Encryption
Feedback
Fields (mathematics)
Logical networks
Mathematical analysis
nonsingularity
semi-tensor product
Shift registers
Tensors
Trivium-like cascade FSRs
Online AccessGet full text

Cover

More Information
Summary:In stream cipher designing, nonsingularity is a crucial requirement to ensure that the feedback shift registers (FSRs) do not produce keys that are equivalent to one another. This study uses a semi-tensor product to examine the nonsingularity of Trivium-like cascade FSRs over a finite field. The Trivium-like cascade FSRs are expressed algebraically using the semi-tensor product, allowing them to be viewed as logical networks and introducing a novel state transition matrix. Several necessary and sufficient conditions for the nonsingularity of FSRs and Trivium-like cascade FSRs over a finite field are established by dividing the structural matrices of feedback functions into different parts. These findings are also applicable to binary FSRs and binary Trivium-like cascade FSRs.
ISSN:0020-7179
1366-5820
DOI:10.1080/00207179.2022.2160825