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 条
  • [21] 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 (03) : 75 - 86
  • [22] Linear complexity problems of level sequences of Euler quotients and their related binary sequences
    Niu, Zhihua
    Chen, Zhixiong
    Du, Xiaoni
    SCIENCE CHINA-INFORMATION SCIENCES, 2016, 59 (03)
  • [23] On k-Error Linear Complexity of Binary Sequences Derived From Euler Quotients Modulo 2p
    Wu, Chenhuang
    Edemskiy, Vladimir
    Xu, Chunxiang
    IEEE ACCESS, 2020, 8 : 51477 - 51481
  • [24] Trace representation of binary Jacobi sequences
    Dai, ZD
    Gong, G
    Song, HY
    2003 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS, 2003, : 379 - 379
  • [25] A trace representation of binary Jacobi sequences
    State Key Laboratory of Information Security, Graduate School, Chinese Academy of Sciences, 100039 Beijing, China
    不详
    不详
    Discrete Math, 1600, 6 (1517-1527):
  • [26] A trace representation of binary Jacobi sequences
    Dai, Zongduo
    Gong, Guang
    Song, Hong-Yeop
    DISCRETE MATHEMATICS, 2009, 309 (06) : 1517 - 1527
  • [27] Linear Complexity of Some Binary Sequences Derived from Fermat Quotients
    Chen Zhixiong
    Hu Lei
    Du Xiaoni
    CHINA COMMUNICATIONS, 2012, 9 (02) : 105 - 108
  • [28] On the linear complexity of binary threshold sequences derived from Fermat quotients
    Chen, Zhixiong
    Du, Xiaoni
    DESIGNS CODES AND CRYPTOGRAPHY, 2013, 67 (03) : 317 - 323
  • [29] On the linear complexity of binary threshold sequences derived from Fermat quotients
    Zhixiong Chen
    Xiaoni Du
    Designs, Codes and Cryptography, 2013, 67 : 317 - 323
  • [30] Pseudorandom sequences derived from automatic sequences
    Merai, Laszlo
    Winterhof, Arne
    CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND SEQUENCES, 2022, 14 (04): : 783 - 815
12345