On the Linear Complexity of Two Classes of Quaternary Sequences over Z<sub>4</sub> with Optimal Autocorrelation

ZHAO Lu; LIU Chun-hong; DU Jiao; CAO Tian-qing

doi:10.12263/DZXB.20190961

您当前的位置：

首页 >

文章列表页 >

On the Linear Complexity of Two Classes of Quaternary Sequences over Z₄ with Optimal Autocorrelation

更新时间：2025-12-08

- On the Linear Complexity of Two Classes of Quaternary Sequences over Z₄ with Optimal Autocorrelation
- Acta Electronica Sinica Vol. 49, Issue 4, Pages: 631-636(2021)
- 作者机构：
  
  1. 天津工业大学数学科学学院,天津,300387
  2. 河南师范大学计算机与信息工程学院,河南,新乡,453007
  3. 河南师范大学数学与信息科学学院,河南,新乡,453007
  4. 河南师范大学大数据统计与优化控制河南省工程实验室,河南,新乡,453007
  5. 天津工业大学数学科学学院,天津,300387
  6. 河南师范大学计算机与信息工程学院,河南,新乡,453007
  7. 河南师范大学数学与信息科学学院,河南,新乡,453007
  8. 河南师范大学大数据统计与优化控制河南省工程实验室,河南,新乡,453007
- 作者简介：
- 基金信息：
- DOI：10.12263/DZXB.20190961
  CLC： TN918.4
- Published：2021
- 稿件说明：
移动端阅览
ZHAO Lu, LIU Chun-hong, DU Jiao, et al. On the Linear Complexity of Two Classes of Quaternary Sequences over Z₄ with Optimal Autocorrelation[J]. Acta Electronica Sinica, 2021, 49(4): 631-636.
DOI：

ZHAO Lu, LIU Chun-hong, DU Jiao, et al. On the Linear Complexity of Two Classes of Quaternary Sequences over Z₄ with Optimal Autocorrelation[J]. Acta Electronica Sinica, 2021, 49(4): 631-636. DOI： 10.12263/DZXB.20190961.

摘要

线性复杂度是序列密码中重要的安全性指标.针对Z

上两类具有最优自相关的四元序列，对其线性复杂度进行研究.利用Galois理论，分别得到了由Legendre序列、双素数序列及广义GMW序列构造的四元序列线性复杂度的精确值.

Abstract

The linear complexity of quaternary sequences plays an important role in stream ciphers. In this paper

we investigate the linear complexity of two classes of quaternary sequences over Z

with optimal autocorrelation. Furthermore

by the theory of Galois rings

the exact value of the linear complexity of sequences constructed from Legendre sequences

twin-prime sequences and generalized GMW sequences are derived

respectively.

关键词

Keywords

references

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Secure Computation of Subsets from Tuple Sets

Concrete Constructions of k-Rotation Symmetric 2-Resilient Boolean Functions

Maximum Value of Sum of Intersection Elements of Secret Calculation

The 4-Error Linear Complexity of Binary Periodic Sequences

Related Author

LI Shun-dong

DU Ji-xin

YU Jia-tong

WU Chuan-yu

LIU Chun-hong

LI Long-fei

GAO Qiang

WANG Tian-yin

Related Institution

School of Computer Science, Shaanxi Normal University

School of Computer and Information Engineering, Henan Normal University

School of Mathematics and Statistics, Henan Normal University

Faculty of Mathematical Sciences, Luoyang Normal University

School of Computer Science， Shaanxi Normal University

⁰

On the Linear Complexity of Two Classes of Quaternary Sequences over Z4 with Optimal Autocorrelation

DOI：10.12263/DZXB.20190961

摘要

Abstract

关键词

Keywords

references

On the Linear Complexity of Two Classes of Quaternary Sequences over Z₄ with Optimal Autocorrelation