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

doi:10.1016/j.jco.2003.08.017

beta

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

W. Meidl, Arne Winterhof

Apr 1, 2004

Citations

Journal

J. Complex.

Full text

Semantic Scholar

Key Takeaway

Key Takeaway: This paper introduces new explicit inversive pseudorandom number generators and provides near-best linear complexity profiles for their applications in cryptography and Monte-Carlo methods.

Abstract

Linear complexity and linear complexity profile are interesting characteristics of a sequence for applications in cryptography and Monte-Carlo methods. We introduce some new explicit inversive pseudorandom number generators and prove lower bounds on their linear complexity profile which are close to the best possible.

Text copied to clipboard

copied to clipboard