Trace Representation of the Sequences Derived from Polynomial Quotient

被引：2
|
作者：
Zhao, Liping [1 ]
Du, Xiaoni [1 ]
Wu, Chenhuang [2 ]
机构：
[1] Northwest Normal Univ, Lanzhou 730070, Gansu, Peoples R China
[2] Putian Univ, Putian 351100, Fujian, Peoples R China
来源：
CLOUD COMPUTING AND SECURITY, PT IV | 2018年 / 11066卷
基金：
中国国家自然科学基金;
关键词：
Polynomial quotient; Trace representation; Fourier transform; Defining pairs; Binary sequence; LINEAR COMPLEXITY; CHARACTER SUMS;
D O I：
10.1007/978-3-030-00015-8_3
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
The discrete Fourier transform and trace representation of certain sequences can help generate the sequences efficiently and analyse their cryptographic properties. In this paper, we first determine the defining pairs of the binary sequences derived from a class of polynomial quotient modulo an odd prime p and the Legendre symbol. We then derive the discrete Fourier transform and the trace representation of this class of sequences.
引用
收藏
页码：26 / 37
页数：12
相关论文
共 50 条
  • [1] Trace representation of pseudorandom binary sequences derived from Euler quotients
    Chen, Zhixiong
    Du, Xiaoni
    Marzouk, Radwa
    APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING, 2015, 26 (06) : 555 - 570
  • [2] 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
  • [3] Trace representation and linear complexity of binary sequences derived from Fermat quotients
    Chen ZhiXiong
    SCIENCE CHINA-INFORMATION SCIENCES, 2014, 57 (11) : 1 - 10
  • [4] Trace Representation of r-ary Sequences Derived from Fermat Quotients
    Du X.-N.
    Li Z.-X.
    Wan Y.-Q.
    Li X.-D.
    2017, Chinese Institute of Electronics (45): : 2439 - 2442
  • [5] Trace representation and linear complexity of binary sequences derived from Fermat quotients
    ZhiXiong Chen
    Science China Information Sciences, 2014, 57 : 1 - 10
  • [6] Trace representation and linear complexity of binary sequences derived from Fermat quotients
    CHEN ZhiXiong
    Science China(Information Sciences), 2014, 57 (11) : 121 - 130
  • [7] 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
  • [8] POLYNOMIAL REPRESENTATION OF A CLASS OF SEQUENCES
    戴宗铎
    ScienceBulletin, 1987, (10) : 649 - 654
  • [9] POLYNOMIAL REPRESENTATION OF A CLASS OF SEQUENCES
    DAI, ZD
    KEXUE TONGBAO, 1987, 32 (10): : 649 - 654
  • [10] 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
12345