[图书][B] Applied number theory

H Niederreiter, A Winterhof - 2015 - Springer
Harald Niederreiter Arne Winterhof Page 1 Applied Number Theory Harald Niederreiter Arne
Winterhof Page 2 Applied Number Theory Page 3 Page 4 Harald Niederreiter • Arne Winterhof …

New constructions for optimal sets of frequency-hopping sequences

Z Zhou, X Tang, D Peng… - IEEE Transactions on …, 2011 - ieeexplore.ieee.org
In this paper, two generic constructions of optimal frequency-hopping sequence (FHS) sets
employing d-form functions with difference-balanced property are presented. They …

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 …

Correlation measure, linear complexity and maximum order complexity for families of binary sequences

Z Chen, AI Gómez, D Gómez-Pérez, A Tirkel - Finite Fields and Their …, 2022 - Elsevier
The correlation measure of order k is an important measure of pseudorandomness for binary
sequences. This measure tries to look for dependence between several shifted versions of a …

Multiplicative character sums of Fermat quotients and pseudorandom sequences

D Gomez, A Winterhof - Periodica Mathematica Hungarica, 2012 - akjournals.com
We prove a bound on sums of products of multiplicative characters of shifted Fermat
quotients modulo p. From this bound we derive results on the pseudorandomness of …

Linear complexity of binary sequences derived from Euler quotients with prime-power modulus

X Du, Z Chen, L Hu - Information Processing Letters, 2012 - Elsevier
We extend the definition of binary threshold sequences from Fermat quotients to Euler
quotients modulo pr with odd prime p and r⩾ 1. Under the condition of 2p− 1≢ 1 (modp2) …

Sequences with high nonlinear complexity

H Niederreiter, C Xing - IEEE Transactions on Information …, 2014 - ieeexplore.ieee.org
We improve lower bounds on the k th-order nonlinear complexity of pseudorandom
sequences over finite fields, including explicit inversive sequences and sequences obtained …

Trace representation of pseudorandom binary sequences derived from Euler quotients

Z Chen, X Du, R Marzouk - Applicable Algebra in Engineering …, 2015 - Springer
We give the trace representation of a family of binary sequences derived from Euler
quotients by determining the corresponding defining polynomials. The result extends an …

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 …

Autocorrelation of Legendre–Sidelnikov Sequences

M Su, A Winterhof - IEEE Transactions on Information Theory, 2010 - ieeexplore.ieee.org
We combine the concepts of the p-periodic Legendre sequence, the (q-1)-periodic
Sidelnikov sequence and the two-prime generator to introduce a new p (q-1)-periodic …