On the generalized joint linear complexity profile of a class of nonlinear pseudorandom multisequences

DOI10.3934/AMC.2010.4.369zbMath1215.65009OpenAlexW2013111830MaRDI QIDQ540384

Alina Ostafe, Arne Winterhof, Igor E. Shparlinski

Publication date: 3 June 2011

Published in: Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/amc.2010.4.369

zbMATH Keywords

linear complexitynonlinear pseudorandom number generators

Mathematics Subject Classification ID

Cryptography (94A60) Random number generation in numerical analysis (65C10) Pseudo-random numbers; Monte Carlo methods (11K45)

Related Items (4)

MULTIPLICATIVE CHARACTER SUMS OF A CLASS OF NONLINEAR RECURRENCE VECTOR SEQUENCES ⋮ Pseudorandom numbers and hash functions from iterations of multivariate polynomials ⋮ Pseudorandom vector sequences of maximal period generated by triangular polynomial dynamical systems ⋮ Algebraic entropy, automorphisms and sparsity of algebraic dynamical systems and pseudorandom number generators

This page was built for publication: On the generalized joint linear complexity profile of a class of nonlinear pseudorandom multisequences