On the linear complexity of binary threshold sequences derived from Fermat quotients

被引：51

作者：

Chen, Zhixiong ^{[1
,2
]}

Du, Xiaoni ^{[3
]}

机构：

[1] Putian Univ, Dept Math, Putian 351100, Fujian, Peoples R China

[2] Chinese Acad Sci, Grad Sch, State Key Lab Informat Secur, Beijing 100049, Peoples R China

[3] Northwest Normal Univ, Coll Math & Informat Sci, Lanzhou 730070, Gansu, Peoples R China

来源：

DESIGNS CODES AND CRYPTOGRAPHY | 2013年 / 67卷 / 03期

基金：

中国国家自然科学基金;

关键词：

Fermat quotients; Finite fields; Binary sequences; Linear complexity; Cryptography; SUMS;

D O I：

10.1007/s10623-012-9608-3

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We determine the linear complexity of a family of p (2)-periodic binary threshold sequences derived from Fermat quotients modulo an odd prime p, where p satisfies . The linear complexity equals p (2) - p or p (2) - 1, depending whether or 3 (mod 4). Our research extends the results from previous work on the linear complexity of the corresponding binary threshold sequences when 2 is a primitive root modulo p (2). Moreover, we present a partial result on their linear complexities for primes p with . However such so called Wieferich primes are very rare.

引用

页码：317 / 323

页数：7

共 50 条

[31] Trace representation of pseudorandom binary sequences derived from Euler quotients [J].

Zhixiong Chen ;

Xiaoni Du ;

Radwa Marzouk .

Applicable Algebra in Engineering, Communication and Computing, 2015, 26 :555-570

[32] Improvements on k-error linear complexity of q-ary sequences derived from Euler quotients [J].

Edemskiy, Vladimir ;

Wu, Chenhuang ;

Xu, Chunxiang .

CRYPTOLOGIA, 2022, 46 (02) :148-166

[33] Linear Complexity of New Binary Sequence Derived From Polynomial Quotients Modulo p in General Case and Their Generalizations [J].

Ma, Jiang ;

Zhang, Jun ;

Jia, Yanguo ;

Shen, Xiumin .

IEEE ACCESS, 2022, 10 :98855-98859

[34] Trace representation of the binary pq2-periodic sequences derived from Euler quotients [J].

Jingwei Zhang ;

Chuangqiang Hu ;

Xiang Fan ;

Chang-An Zhao .

Cryptography and Communications, 2021, 13 :343-359

[35] Trace representation of the binary pq2-periodic sequences derived from Euler quotients [J].

Zhang, Jingwei ;

Hu, Chuangqiang ;

Fan, Xiang ;

Zhao, Chang-An .

CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND SEQUENCES, 2021, 13 (02) :343-359

[36] On the k-error linear complexity of binary sequences derived from polynomial quotients多项式商构造的二元序列的k-错线性复杂度 [J].

ZhiXiong Chen ;

ZhiHua Niu ;

ChenHuang Wu .

Science China Information Sciences, 2015, 58 :1-15

[37] New Binary Sequences Derived from Euler Quotients Modulo pq and Their Generalizations [J].

Ma, Jiang ;

Zhang, Jun ;

Jia, Yanguo ;

Shen, Xiumin .

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2023, E106A (04) :657-664

[38] The linear complexity of a class of binary sequences with optimal autocorrelation [J].

Cuiling Fan .

Designs, Codes and Cryptography, 2018, 86 :2441-2450

[39] The linear complexity of a class of binary sequences with optimal autocorrelation [J].

Fan, Cuiling .

DESIGNS CODES AND CRYPTOGRAPHY, 2018, 86 (10) :2441-2450

[40] ON THE DISTRIBUTION OF PSEUDORANDOM NUMBERS AND VECTORS DERIVED FROM EULER-FERMAT QUOTIENTS [J].

Chen, Zhixiong ;

Winterhof, Arne .

INTERNATIONAL JOURNAL OF NUMBER THEORY, 2012, 8 (03) :631-641

← 1 2 3 4 5 →