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 条
  • [31] Structure of Pseudorandom Numbers Derived from Fermat Quotients
    Chen, Zhixiong
    Ostafe, Alina
    Winterhof, Arne
    ARITHMETIC OF FINITE FIELDS, PROCEEDINGS, 2010, 6087 : 73 - +
  • [32] Linear Complexity of a Family of Binary pq2-Periodic Sequences From Euler Quotients
    Zhang, Jingwei
    Gao, Shuhong
    Zhao, Chang-An
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2020, 66 (09) : 5774 - 5780
  • [33] Linear complexity of pseudorandom sequences generated by Fermat quotients and their generalizations
    Du, Xiaoni
    Klapper, Andrew
    Chen, Zhixiong
    INFORMATION PROCESSING LETTERS, 2012, 112 (06) : 233 - 237
  • [34] Trace Representation of the Sequences Derived from Polynomial Quotient
    Zhao, Liping
    Du, Xiaoni
    Wu, Chenhuang
    CLOUD COMPUTING AND SECURITY, PT IV, 2018, 11066 : 26 - 37
  • [35] Linear Complexity of Binary Threshold Sequences Derived from Generalized Polynomial Quotient with Prime-Power Modulus
    Wang, Lianhua
    Du, Xiaoni
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2020, 31 (05) : 569 - 581
  • [36] Improvements on k-error linear complexity of q-ary sequences derived from Euler quotients
    Edemskiy, Vladimir
    Wu, Chenhuang
    Xu, Chunxiang
    CRYPTOLOGIA, 2022, 46 (02) : 148 - 166
  • [37] Pseudorandom sequences derived from automatic sequences
    Merai, Laszlo
    Winterhof, Arne
    CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND SEQUENCES, 2022, 14 (04): : 783 - 815
  • [38] Pseudorandom sequences derived from automatic sequences
    László Mérai
    Arne Winterhof
    Cryptography and Communications, 2022, 14 : 783 - 815
  • [39] Trace Representation of Binary Generalized Cyclotomic Sequences with Length pm
    Du, Xiaoni
    Chen, Zhixiong
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2011, E94A (02) : 761 - 765
  • [40] Linear complexity problems of level sequences of Euler quotients and their related binary sequences欧拉商的权位序列及其二元序列的线性复杂度问题
    Zhihua Niu
    Zhixiong Chen
    Xiaoni Du
    Science China Information Sciences, 2016, 59
12345