DocumentCode :
3306062
Title :
Analysis of the Minerror of the pn-Periodic Sequences
Author :
Niu, Zhihua ; Guo, Danfeng ; Xin, Mingjun
Author_Institution :
Sch. of Comput. Eng. & Sci., Shanghai Univ., Shanghai, China
fYear :
2011
fDate :
19-20 Dec. 2011
Firstpage :
117
Lastpage :
121
Abstract :
To ensure the security of the data during transmission, the data should be encrypted by a key stream sequence which should be strong enough with good randomness and unpredictability. Cryptographically strong sequences should not only have a large linear complexity, but also the change of a few terms should not cause a significant decrease of the linear complexity. This requirement leads to the theory of the stability of linear complexity. K-error linear complexity reflects the stability of the linear complexity properly. In this paper, by analyzing the relationship between the linear complexity and the k-error linear complexity of pn- periodic sequence, we studied the upper bound of minerror, i.e. the minimum value k for which the k-error linear complexity is strictly less than the linear complexity. Here p is an odd prime, and q is a prime and a primitive root (mod p2).
Keywords :
computational complexity; cryptography; data communication; sequences; K-error linear complexity; cryptography; data security; data transmission; encryption; minerror; pn-periodic sequences; stability; Complexity theory; Cryptography; Genetic communication; Polynomials; Stability analysis; Tin; cryptography; information security; linear complexity; random sequences;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Software and Network Engineering (SSNE), 2011 First ACIS International Symposium on
Conference_Location :
Seoul
Print_ISBN :
978-1-4673-0349-1
Type :
conf
DOI :
10.1109/SSNE.2011.24
Filename :
6150085
Link To Document :
بازگشت