[图书][B] Handbook of finite fields
GL Mullen, D Panario - 2013 - api.taylorfrancis.com
The CRC Handbook of Finite Fields (hereafter referred to as the Handbook) is a reference
book for the theory and applications of finite fields. It is not intended to be an introductory …
book for the theory and applications of finite fields. It is not intended to be an introductory …
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 …
Linear complexity and related complexity measures for sequences
H Niederreiter - International Conference on Cryptology in India, 2003 - Springer
We present a survey of recent work on the linear complexity, the linear complexity profile,
and the k-error linear complexity of sequences and on the joint linear complexity of …
and the k-error linear complexity of sequences and on the joint linear complexity of …
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 …
Recent results on recursive nonlinear pseudorandom number generators
A Winterhof - International Conference on Sequences and Their …, 2010 - Springer
This survey article collects recent results on recursive nonlinear pseudorandom number
generators and sketches some important proof techniques. We mention upper bounds on …
generators and sketches some important proof techniques. We mention upper bounds on …
Structure of pseudorandom numbers derived from Fermat quotients
We study the distribution of s-dimensional points of Fermat quotients modulo p with arbitrary
lags. If no lags coincide modulo p the same technique as in [21] works. However, there are …
lags. If no lags coincide modulo p the same technique as in [21] works. However, there are …
On the linear complexity profile of some new explicit inversive pseudorandom numbers
W Meidl, A Winterhof - Journal of Complexity, 2004 - Elsevier
Linear complexity and linear complexity profile are interesting characteristics of a sequence
for applications in cryptography and Monte-Carlo methods. We introduce some new explicit …
for applications in cryptography and Monte-Carlo methods. We introduce some new explicit …
Pseudorandom sequences derived from automatic sequences
L Mérai, A Winterhof - Cryptography and Communications, 2022 - Springer
Many automatic sequences, such as the Thue-Morse sequence or the Rudin-Shapiro
sequence, have some desirable features of pseudorandomness such as a large linear …
sequence, have some desirable features of pseudorandomness such as a large linear …
[HTML][HTML] On the Nth linear complexity of automatic sequences
L Mérai, A Winterhof - Journal of Number Theory, 2018 - Elsevier
The Nth linear complexity of a sequence is a measure of predictability. Any unpredictable
sequence must have large Nth linear complexity. However, in this paper we show that for q …
sequence must have large Nth linear complexity. However, in this paper we show that for q …
Measures of pseudorandomness: Arithmetic autocorrelation and correlation measure
R Hofer, L Mérai, A Winterhof - … and Applications: Festschrift in Honour of …, 2017 - Springer
We prove a relation between two measures of pseudorandomness, the arithmetic
autocorrelation, and the correlation measure of order k. Roughly speaking, we show that any …
autocorrelation, and the correlation measure of order k. Roughly speaking, we show that any …