Calculation for the linear complexity of primitive &amp;#x03C3;-LFSR sequences

Fengxiu Gao Fengxiu Gao,Xianghui Liu Xianghui Liu,Na Zhang Na Zhang,Yang Yang Yang Yang

doi:10.1109/csqrwc.2011.6037105

Calculation for the linear complexity of primitive &#x03C3;-LFSR sequences

Fengxiu Gao Fengxiu Gao, Xianghui Liu Xianghui Liu + Show 2 more

https://doi.org/10.1109/csqrwc.2011.6037105

Copy DOI

Publication Date: Jul 1, 2011

Citations: 2

Affiliation: Zhejiang Science and Technology Information Institute, Wuhan Engineering Science & Technology Institute

#Good Cryptographic Properties #LFSR Sequences + Show 8 more

Abstract
Full-Text PDF
Similar Papers

Abstract

σ-LFSR is a kind of word-oriented LFSR with high efficiency and good cryptographic properties, especially its software implementation is efficient for modern processors. In practice, primitive σ-LFSR sequences are of the most valuable, and linear complexity is an important parameter of sequences' security. In this paper, linear complexity of primitive σ-LFSR sequences is studied firstly. Then, with the tool of circulant matrix, a method to determine the linear complexity of primitive σ-LFSR sequence is obtained, which could help us calculate linear complexity of σ-LFSR easily.

Full Text