通信学报 ›› 2008, Vol. 29 ›› Issue (3): 23-26.doi: 1000-436X(2008)03-0023-04

• 学术论文 • 上一篇    下一篇

Galois环上的一类GMW序列及其线性复杂度

孙霓刚1,2,胡磊2   

  1. 1 华东理工大学 计算机科学与工程系,上海 200237
    2 中国科学院研究生院 信息安全国家重点实验室,北京 100049
  • 出版日期:2008-03-25 发布日期:2017-06-09
  • 基金资助:
    国家自然科学基金资助项目;国家自然科学基金资助项目

GMW sequences over Galois rings and their linear complexities

Ni-gang SUN1,2,Lei HU2   

  1. 1 Department of Computer Science and Engineering,East China University of Science and Technology,Shanghai 200237,China
    2 State Key Laboratory of Information Security,Graduate University of Chinese Academy of Sciences,Beijing 100049,China
  • Online:2008-03-25 Published:2017-06-09
  • Supported by:
    The National Natural Science Foundation of China;The National Natural Science Foundation of China

摘要:

将有限域上GMW序列的概念推广到了一般的Galois环上。利用环上的置换,定义了一类新的一般Galois环上的GMW序列,并对其线性复杂度进行了估计。结果表明,这类GMW序列具有非常大的线性复杂度。

关键词: 密码学, GMW序列, 线性复杂度, Galois环

Abstract:

A new family of GMW sequences over an arbitrary Galois ring was defined.This generalizes the concept of GMW sequences over finite fields.Upper and lower bounds on the linear complexities of this family of GMW sequences were investigated and the result shows that such sequences have large linear complexities.

Key words: cryptography, GMW sequence, linear complexity, Galois ring

No Suggested Reading articles found!