Arithmetic autocorrelation of binary m-sequences

IF 0.3 4区工程技术 Q4 COMPUTER SCIENCE, THEORY & METHODS

Cryptologia Pub Date : 2021-11-09 DOI:10.1080/01611194.2022.2071116

Zhixiong Chen, Zhihua Niu, Yuqi Sang, Chenhuang Wu

引用次数: 5

Abstract

Abstract An m-sequence is the one of the largest period among those produced by a linear feedback shift register. It possesses several desirable features of pseudorandomness such as balance, uniform pattern distribution and ideal autocorrelation for applications to communications. However, it also possesses undesirable features such as low linear complexity. Here we prove a nontrivial upper bound on its arithmetic autocorrelation, another figure of merit introduced by Mandelbaum for error-correcting codes and later investigated by Goresky and Klapper for FCSRs. The upper bound is close to half of the period and hence rather large, which gives an undesirable feature.

查看原文本刊更多论文

二进制m序列的算术自相关

摘要m序列是由线性反馈移位寄存器产生的周期最大的序列之一。它具有均衡、均匀分布和理想的自相关等伪随机特性，适合通信应用。然而，它也具有不理想的特征，如低线性复杂度。在这里，我们证明了它的算术自相关的非平凡上界，这是Mandelbaum为纠错码引入的另一个优点，后来由Goresky和Klapper对fcsr进行了研究。上界接近周期的一半，因此相当大，这给出了一个不希望看到的特征。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Cryptologia 工程技术-计算机：理论方法

自引率

33.30%

发文量

审稿时长

24 months

期刊介绍： Cryptologia is the only scholarly journal in the world dealing with the history, the technology, and the effect of the most important form of intelligence in the world today - communications intelligence. It fosters the study of all aspects of cryptology -- technical as well as historical and cultural. The journal"s articles have broken many new paths in intelligence history. They have told for the first time how a special agency prepared information from codebreaking for President Roosevelt, have described the ciphers of Lewis Carroll, revealed details of Hermann Goering"s wiretapping agency, published memoirs - written for it -- of some World War II American codebreakers, disclosed how American codebreaking affected the structure of the United Nations.