Trace representation of pseudorandom binary sequences derived from Euler quotients

被引：15
|
作者：
Chen, Zhixiong [1 ,2 ]
Du, Xiaoni [2 ,3 ]
Marzouk, Radwa [4 ]
机构：
[1] Putian Univ, Prov Key Lab Appl Math, Putian 351100, Fujian, Peoples R China
[2] Xidian Univ, State Key Lab Integrated Serv Networks, Xian 710071, Shaanxi, Peoples R China
[3] Northwest Normal Univ, Coll Math & Stat, Lanzhou 730070, Gansu, Peoples R China
[4] Cairo Univ, Fac Sci, Dept Math, Giza 12613, Egypt
来源：
APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING | 2015年 / 26卷 / 06期
基金：
中国国家自然科学基金;
关键词：
Cryptography; Pseudorandom binary sequences; Euler quotients; Fermat quotients; Trace function; LINEAR COMPLEXITY; FERMAT QUOTIENTS; CHARACTER SUMS; VALUE SET; NUMBERS; DIVISIBILITY;
D O I：
10.1007/s00200-015-0265-4
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
We give the trace representation of a family of binary sequences derived from Euler quotients by determining the corresponding defining polynomials. The result extends an earlier result of Z. Chen on the trace of binary sequences derived from Fermat quotients modulo a prime. However, the case of composite modulus brings some interesting twists. Trace representation can help us producing the sequences efficiently and analyzing their cryptographic properties, such as linear complexity.
引用
收藏
页码：555 / 570
页数：16
相关论文
共 50 条
  • [1] Trace representation of pseudorandom binary sequences derived from Euler quotients
    Zhixiong Chen
    Xiaoni Du
    Radwa Marzouk
    Applicable Algebra in Engineering, Communication and Computing, 2015, 26 : 555 - 570
  • [2] Trace representation of the binary pq2-periodic sequences derived from Euler quotients
    Zhang, Jingwei
    Hu, Chuangqiang
    Fan, Xiang
    Zhao, Chang-An
    CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND SEQUENCES, 2021, 13 (02): : 343 - 359
  • [3] Trace representation of the binary pq2-periodic sequences derived from Euler quotients
    Jingwei Zhang
    Chuangqiang Hu
    Xiang Fan
    Chang-An Zhao
    Cryptography and Communications, 2021, 13 : 343 - 359
  • [4] Some Notes on Pseudorandom Binary Sequences Derived from Fermat-Euler Quotients
    Ye, Zhifan
    Ke, Pinhui
    Zhang, Shengyuan
    Chang, Zuling
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2015, E98A (10) : 2199 - 2202
  • [5] Further Results on Pseudorandom Binary Sequences Derived from Fermat-Euler Quotients
    Ye, Zhifan
    Ke, Pinhui
    Chen, Zhixiong
    2015 10TH INTERNATIONAL CONFERENCE ON INFORMATION, COMMUNICATIONS AND SIGNAL PROCESSING (ICICS), 2015,
  • [6] ON k-ERROR LINEAR COMPLEXITY OF PSEUDORANDOM BINARY SEQUENCES DERIVED FROM EULER QUOTIENTS
    Chen, Zhixiong
    Edemskiy, Vladimir
    Ke, Pinhui
    Wu, Chenhuang
    ADVANCES IN MATHEMATICS OF COMMUNICATIONS, 2018, 12 (04) : 805 - 816
  • [7] Trace representation and linear complexity of binary sequences derived from Fermat quotients
    ZhiXiong Chen
    Science China Information Sciences, 2014, 57 : 1 - 10
  • [8] Trace representation and linear complexity of binary sequences derived from Fermat quotients
    Chen ZhiXiong
    SCIENCE CHINA-INFORMATION SCIENCES, 2014, 57 (11) : 1 - 10
  • [9] Trace representation and linear complexity of binary sequences derived from Fermat quotients
    CHEN ZhiXiong
    Science China(Information Sciences), 2014, 57 (11) : 121 - 130
  • [10] Correlation measures of binary sequences derived from Euler quotients
    Liu, Huaning
    Chen, Zhixiong
    Wu, Chenhuang
    arXiv, 2021,
12345