On the Expansion Complexity of Sequences Over Finite Fields

被引：7

作者：

Gomez-Perez, Domingo ^{[1
]}

Merai, Laszlo ^{[2
]}

Niederreiter, Harald ^{[2
]}

机构：

[1] Univ Cantabria, Dept Math, E-39005 Santander, Spain

[2] Austrian Acad Sci, Johann Radon Inst Computat & Appl Math, A-4040 Linz, Austria

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 2018年 / 64卷 / 06期

基金：

奥地利科学基金会;

关键词：

Pseudorandom sequence; expansion complexity; inversive generator; LINEAR COMPLEXITY; SERIES;

D O I：

10.1109/TIT.2018.2792490

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

In 2012, Diem introduced a new figure of merit for cryptographic sequences called expansion complexity. In this paper, we slightly modify this notion to obtain the so-called irreducible-expansion complexity which is more suitable for certain applications. We analyze both, the classical and the modified expansion complexity. Moreover, we also study the expansion complexity of the explicit inversive congruential generator.

引用

页码：4228 / 4232

页数：5

共 9 条

[1]

[Anonymous], 1992, PROBABILITY

[2]

Carlitz L., 1963, ILLINOIS J MATH, V7, P371

[3]

CHRISTOL G, 1980, B SOC MATH FR, V108, P401

[4] On the use of expansion series for stream ciphers [J].

Diem, Claus .

LMS JOURNAL OF COMPUTATION AND MATHEMATICS, 2012, 15 :326-340

[5]

Meidl W., 2013, HDB FINITE FIELDS, P324

[6] Expansion complexity and linear complexity of sequences over finite fields [J].

Merai, Laszlo ;

Niederreiter, Harald ;

Winterhof, Arne .

CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND SEQUENCES, 2017, 9 (04) :501-509

[7]

Niederreiter H, 2003, LECT NOTES COMPUT SC, V2904, P1

[8]

Winterhof Arne, 2010, Selected Topics in Information and Coding Theory, P3, DOI 10.1142/9789812837172_0001

[9] Sequences with almost perfect linear complexity profiles and curves over finite fields [J].

Xing, CP ;

Lam, KY .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1999, 45 (04) :1267-1270

← 1 →