By Topic

Calculation for the linear complexity of primitive σ-LFSR sequences

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Fengxiu Gao ; Zhengzhou Inf. Sci. & Technol. Inst., Zhengzhou, China ; Yang Yang ; Na Zhang ; Xianghui Liu

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

Published in:

Cross Strait Quad-Regional Radio Science and Wireless Technology Conference (CSQRWC), 2011  (Volume:2 )

Date of Conference:

26-30 July 2011