期刊文献+

基于模素数幂欧拉商的r元序列的迹表示

Trace representation of r-ary sequences derived from Euler quotients with prime-power modulus
下载PDF
导出
摘要 基于费马商和欧拉商构造的伪随机序列族具有良好的密码学性质.基于欧拉商确定了具有素数幂周期的r(r 为奇素数)元序列的定义对和离散傅里叶变换,得到了该序列的迹表示,这对序列的工程实现具有积极的意义. Families of pseudorandom sequences derived from Fermat quotients and Euler quotients possess good cryptographic properties.In this paper,the definition pairs of r-ary sequences with prime power period and discrete Fourier transform are determined,which is based on Euler quotients.Then the trace representation of the sequences is obtained,which is of positive significance to the engineering implementation of the sequences.
作者 杜小妮 王莲花 李丽 DU Xiao-ni;WANG Lian-hua;LI Li(College of Mathematics and Statistics,Northwest Normal University,Lanzhou 730070,Gansu China)
出处 《西北师范大学学报(自然科学版)》 CAS 北大核心 2019年第5期1-5,共5页 Journal of Northwest Normal University(Natural Science)
基金 国家自然科学基金资助项目(61562077,61772022)
关键词 r元序列 欧拉商 费马商 离散傅里叶变换 定义对 迹表示 r-ary sequences Euler quotients Fermat quotients discrete Fourier transform defining pairs trace representation
  • 相关文献

参考文献3

二级参考文献20

  • 1杨光,刘冠军,李金国,杨国峰.基于故障检测和可靠性约束的传感器布局优化[J].电子学报,2006,34(2):348-351. 被引量:20
  • 2ERNVALL R,METSNKYL T. On the p-Divisibility of Fer- mat Quotients[J]. Mathematics of Computation,1997,66(219): 1353-1365.
  • 3CHEN Zhixiong,OSTAFE A,WINTERHOF A. Structure of Pseudorandom Numbers Derived from Fermat Quotients [J]. Lecture Notes in Computer Science,2010,6087/2010: 73-85.
  • 4GOMEZ D,WINTERHOF A. Multiplicative Character Sums of Fermat Quotients and Pseudorandom Sequences[J]. Peri- odica Mathematica Hungarica,2011 (to appear).
  • 5OSTAFE A,SHPARLINSKI I E. Pseudorandomness and Dy- namics of Fermat Quotients [J]. SIAM Journal on Discrete Mathematics,2011,25(1): 50-71.
  • 6SHPARLINSKI I E. Character Sums with Fermat Quotients[J]. Quarterly Journal of Mathematics,2011,62(4): 1031-1043.
  • 7GRANVILLE A. Some Conjectures Related to Fermat's Last Theorem[C] // Proceedings of the First Conference of the Ca- nadian Number Theory Association: 1990. New York,1990: 177-192.
  • 8NIEDERREITER H. Linear Complexity and Related Complexity Measures for Sequences[J]. Lecture Notes in Computer Sci- ence,2003,2904/2003: 161-245.
  • 9WINTERHOF A. Linear Complexity and Related Complexity Measures[A]. WOUNGANG I,MISRA S,MISRA S C. Se- lected Topics in Information and Coding Theory,World Sci- entic[C]. Singapore,2010: 3-40.
  • 10MEIDL W. How Many Bits Have to Be Changed to De- crease the Linear Complexity[J]. Designs,Codes and Cryp- tography,2004,33(2): 109-122.

共引文献16

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部