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

DOI10.3934/AMC.2010.4.369zbMATH Open1215.65009OpenAlexW2013111830MaRDI QIDQ540384FDOQ540384

Authors: Alina Ostafe, Igor E. Shparlinski, Arne Winterhof 

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

Recommendations

• Multisequences with high joint nonlinear complexity
• On the joint linear complexity profile of explicit inversive multisequences
• On the Joint Linear Complexity of Linear Recurring Multisequences
• The Probabilistic Theory of the Joint Linear Complexity of Multisequences
• Generalized Joint Linear Complexity of Linear Recurring Multisequences

zbMATH Keywords

linear complexitynonlinear pseudorandom number generators

Mathematics Subject Classification ID

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

Cited In (6)

• Successive minima profile, lattice profile, and joint linear complexity profile of pseudorandom multisequences
• Multiplicative character sums of a class of nonlinear recurrence vector sequences
• Pseudorandom vector sequences of maximal period generated by triangular polynomial dynamical systems
• On the joint linear complexity profile of explicit inversive multisequences
• Pseudorandom numbers and hash functions from iterations of multivariate polynomials
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q540384)