On the joint linear complexity profile of explicit inversive multisequences

Authors:
Wilfried Meidl;Arne Winterhof
Affiliations:
Temasek Laboratories, National University of Singapore, 5 Sports Drive 2, 117508, Singapore;Johann Radon Institute for Computational and Applied Mathematics, Austrian Academy of Sciences, Altenbergerstraße 69, A-4040 Linz, Austria
Venue:
Journal of Complexity
Year:
2005

Citing 9
Cited 1

Analysis and design of stream ciphers

Analysis and design of stream ciphers
The probabilistic theory of linear complexity

Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
Extension of the Berlekamp-Massey algorithm to N dimensions

Information and Computation
Random number generation and quasi-Monte Carlo methods

Random number generation and quasi-Monte Carlo methods
On a new class of pseudorandom numbers for simulation methods

Journal of Computational and Applied Mathematics
Multi-sequences with almost perfect linear complexity profile and function fields over finite fields

Journal of Complexity
On the linear complexity profile of explicit nonlinear pseudorandom numbers

Information Processing Letters
The expected value of the joint linear complexity of periodic multisequences

Journal of Complexity
On the linear complexity profile of some new explicit inversive pseudorandom numbers

Journal of Complexity - Special issue on coding and cryptography

On the structure of digital explicit nonlinear and inversive pseudorandom number generators

Journal of Complexity

Quantified Score

Hi-index	0.00

Visualization

Abstract

We prove lower bounds on the joint linear complexity profile of multisequences obtained by explicit inversive methods and show that for some suitable choices of parameters these joint linear complexity profiles are close to be perfect.