Linear complexity and related complexity measures
A Winterhof - Selected topics in information and coding theory, 2010 - World Scientific
The linear complexity of a sequence is not only a measure for the unpredictability and thus
suitability for cryptography but also of interest in information theory because of its close …
suitability for cryptography but also of interest in information theory because of its close …
Pseudorandom sequences
A Topuzoğlu, A Winterhof - Topics in geometry, coding theory and …, 2007 - Springer
Chapter 4 PSEUDORANDOM SEQUENCES Page 1 Chapter 4 PSEUDORANDOM
SEQUENCES Alev Topuzoglu and Arne Winterhof 1. Introduction Sequences, which are …
SEQUENCES Alev Topuzoglu and Arne Winterhof 1. Introduction Sequences, which are …
On the linear complexity of binary threshold sequences derived from Fermat quotients
Z Chen, X Du - Designs, codes and cryptography, 2013 - Springer
We determine the linear complexity of a family of p 2-periodic binary threshold sequences
derived from Fermat quotients modulo an odd prime p, where p satisfies 2^ p-1\not ≡ 1 (\rm …
derived from Fermat quotients modulo an odd prime p, where p satisfies 2^ p-1\not ≡ 1 (\rm …
On the -error linear complexity of binary sequences derived from polynomial quotients
We investigate the $ k $-error linear complexity of $ p^ 2$-periodic binary sequences
defined from the polynomial quotients (including the well-studied Fermat quotients), which is …
defined from the polynomial quotients (including the well-studied Fermat quotients), which is …
Measures of Pseudorandomness.
K Gyarmati - 2013 - degruyter.com
In the second half of the 1990s Christian Mauduit and András Sárközy [86] introduced a new
quantitative theory of pseudorandomness of binary sequences. Since then numerous …
quantitative theory of pseudorandomness of binary sequences. Since then numerous …
Elliptic curve analogue of Legendre sequences
Z Chen - Monatshefte für Mathematik, 2008 - Springer
The Legendre symbol is applied to the rational points over an elliptic curve to output a family
of binary sequences with strong pseudorandom properties. That is, both the well-distribution …
of binary sequences with strong pseudorandom properties. That is, both the well-distribution …
On -error linear complexity of pseudorandom binary sequences derived from Euler quotients
We investigate the $ k $-error linear complexity of pseudorandom binary sequences of
period $ p^{\mathfrak {r}} $ derived from the Euler quotients modulo $ p^{\mathfrak {r}-1} $, a …
period $ p^{\mathfrak {r}} $ derived from the Euler quotients modulo $ p^{\mathfrak {r}-1} $, a …
On the k-error linear complexity of cyclotomic sequences
H Aly, W Meidl, A Winterhof - Journal of Mathematical Cryptology, 2007 - degruyter.com
On the k-error linear complexity of cyclotomic sequences Page 1 cO de Gruyter 2007 J. Math.
Crypt. 1 (2007), 283–296 DOI 10.1515 / JMC.2007.014 On the k-error linear complexity of …
Crypt. 1 (2007), 283–296 DOI 10.1515 / JMC.2007.014 On the k-error linear complexity of …
The linear complexity of binary sequences of length 2p with optimal three-level autocorrelation
V Edemskiy, A Palvinskiy - Information Processing Letters, 2016 - Elsevier
In this paper we derive the linear complexity of binary sequences of length 2 p with optimal
three-level autocorrelation. These almost balanced and balanced sequences are …
three-level autocorrelation. These almost balanced and balanced sequences are …
New quaternary sequences with ideal autocorrelation constructed from Legendre sequences
In this paper, for an odd prime p, new quaternary sequences of even period 2p with ideal
autocorrelation property are constructed using the binary Legendre sequences of period p …
autocorrelation property are constructed using the binary Legendre sequences of period p …