DocumentCode
1571560
Title
Calculation for the linear complexity of primitive σ-LFSR sequences
Author
Gao, Fengxiu ; Yang, Yang ; Zhang, Na ; Liu, Xianghui
Author_Institution
Zhengzhou Inf. Sci. & Technol. Inst., Zhengzhou, China
Volume
2
fYear
2011
Firstpage
917
Lastpage
919
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.
Keywords
computational complexity; cryptography; circulant matrix; cryptographic properties; linear complexity calculation; primitive σ-LFSR sequences; software implementation; word-oriented LFSR; Cryptography; Indium tin oxide; Polynomials; circulant matrix; linear complexity; primitive σ-LFSR; stream cipher;
fLanguage
English
Publisher
ieee
Conference_Titel
Cross Strait Quad-Regional Radio Science and Wireless Technology Conference (CSQRWC), 2011
Conference_Location
Harbin
Print_ISBN
978-1-4244-9792-8
Type
conf
DOI
10.1109/CSQRWC.2011.6037105
Filename
6037105
Link To Document