Linear Complexity of Some Binary Sequences Derived from Fermat Quotients  

作　　者：Chen Zhixiong Hu Lei, Du Xiaoni 

机构地区：[1]Department of Mathematics, Putian University, Putian 351100, P. R. China [2]State Key Laboratory of Information Security, Graduate School of Chinese Academy of Sciences, Beijing 100049,P. R. China [3]College of Mathematics and Information Science, Northwest Normal University, Lanzhou 730070, P. R. China

出　　处：《China Communications》2012年第2期105-108,共4页中国通信（英文版）

基　　金：the National Natural Science Foundation of China，the Open Funds of State Key Laboratory of Information Security (Chinese Academy of Sciences)，the Program for New Century Excellent Talents in Fujian Province University

摘　　要：We determined the linear complexity of a family of p2-periodic binary threshold sequences and a family of p2-periodic binary sequences constructed using the Legendre symbol,both of which are derived from Fermat quotients modulo an odd prime p.If 2 is a primitive element modulo p2,the linear complexity equals to p2-p or p2-1,which is very close to the period and it is large enough for cryptographic purpose.We determined the linear complexity of a family of p^2-periodic binary threshold sequences and a family of p^2-periodic binary sequences constructed using the Legendre symbol, both of which are derived from Fermat quotients modulo an odd prime p. If 2 is a primitive element modulo p^2, the linear complexity equals to p^2-p or p^2-1, which is very close to the period and it is large enough for cryptographic purpose.

关 键 词：CRYPTOGRAPHY pseudorandom binary sequences fermat quotients finite fields linear complexity 

分 类 号：O123.1[理学—数学] TN918.1[理学—基础数学]