On the joint linear complexity profile of explicit inversive multisequences

DOI10.1016/j.jco.2004.09.001zbMath1094.94023OpenAlexW2018350661MaRDI QIDQ558009

Wilfried Meidl, Arne Winterhof

Publication date: 30 June 2005

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jco.2004.09.001

zbMATH Keywords

ParallelizationInversive methodLinear complexity profileMultisequencesNonlinear pseudorandom numbers

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Random number generation in numerical analysis (65C10) Pseudo-random numbers; Monte Carlo methods (11K45)

Related Items (15)

On the linear complexity profile of some sequences derived from elliptic curves ⋮ Multisequences with high joint nonlinear complexity ⋮ On the structure of digital explicit nonlinear and inversive pseudorandom number generators ⋮ The asymptotic behavior of the joint linear complexity profile of multisequences ⋮ Constructing sequences with high nonlinear complexity using the Weierstrass semigroup of a pair of distinct points of a Hermitian curve ⋮ Construction of sequences with high nonlinear complexity from a generalization of the Hermitian function field ⋮ On the elliptic curve endomorphism generator ⋮ On the \(N\)th linear complexity of automatic sequences ⋮ Expansion complexity and linear complexity of sequences over finite fields ⋮ Hamming correlation of higher order ⋮ Correlation measure, linear complexity and maximum order complexity for families of binary sequences ⋮ Joint linear complexity of multisequences consisting of linear recurring sequences ⋮ The minimal polynomial over \(\mathbb F_q\) of linear recurring sequence over \(\mathbb F_{q^m}\) ⋮ On Pseudorandom Properties of Certain Sequences of Points on Elliptic Curve ⋮ Linear Complexity and Expansion Complexity of Some Number Theoretic Sequences

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extension of the Berlekamp-Massey algorithm to N dimensions
• \(F[x\)-lattice basis reduction algorithm and multisequence synthesis]
• The expected value of the joint linear complexity of periodic multisequences
• On the linear complexity profile of some new explicit inversive pseudorandom numbers
• On the linear complexity profile of explicit nonlinear pseudorandom numbers.
• On a new class of pseudorandom numbers for simulation methods
• A generalization of the Berlekamp-Massey algorithm for multisequence shift-register synthesis with applications to decoding cyclic codes
• Linear Complexity and Random Sequences
• The Probabilistic Theory of Linear Complexity
• Statistical Independence of a New Class of Inversive Congruential Pseudorandom Numbers
• Incomplete exponential sums over finite fields and their applications to new inversive pseudorandom number generators
• Progress in Cryptology - INDOCRYPT 2003
• Shift-register synthesis and BCH decoding
• Multisequences with almost perfect linear complexity profile and function fields over finite fields
• On a new class of inversive pseudorandom numbers for parallelized simulation methods

This page was built for publication: On the joint linear complexity profile of explicit inversive multisequences