activity
20052020
most citedExpansion complexity and linear complexity of sequences over finite fields

20 citations · 35 across the 12 of their papers we have counts for

collaborators
Showing math.NTShow all

7 papers · 1 filter

math.NT2020

Perfect linear complexity profile and Apwenian sequences

J. -P. Allouche, G. -N. Han, H. Niederreiter

Sequences with {\em perfect linear complexity profile} were defined more than thirty years ago in the study of measures of randomness for binary sequences. More recently {\em apwen…

math.NT2017

On the expansion complexity of sequences over finite fields

Gómez-Pérez, László Mérai, Harald Niederreiter

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 irredu…

math.NT2016★ 20 cited

Expansion complexity and linear complexity of sequences over finite fields

László Mérai, Harald Niederreiter, Arne Winterhof

The linear complexity is a measure for the unpredictability of a sequence over a finite field and thus for its suitability in cryptography. In 2012, Diem introduced a new figure of…

math.NT2013

Propagation rules for (u,m,e,s)-nets and (u,e,s)-sequences

Peter Kritzer, Harald Niederreiter

The classes of -nets and -sequences were recently introduced by Tezuka, and in a slightly more restrictive form by Hofer and Niederreiter. We study…

math.NT2013★ 2 cited

Explicit constructions of Vandermonde sequences using global function fields

Roswitha Hofer, Harald Niederreiter

The authors recently introduced so-called Vandermonde nets. These digital nets share properties with the well-known polynomial lattices. For example, both can be constructed via co…

math.NT2012★ 12 cited

Halton-type sequences from global function fields

Harald Niederreiter, Anderson Siang Jing Yeo

For any prime power and any dimension , a new construction of -sequences in base using global function fields is presented. The construction yields an analog of H…

math.NT2012

A construction of (t,s)-sequences with finite-row generating matrices using global function fields

Roswitha Hofer, Harald Niederreiter

For any prime power and any dimension , we present a construction of -sequences in base with finite-row generating matrices such that, for fixed , the qu…