Amanote Research
Register
Sign In
Statistical Complexity of Chaotic Pseudorandom Number Generators
doi 10.2174/9781608057603113010017
Full Text
Open PDF
Abstract
Available in
full text
Date
December 11, 2013
Authors
Unknown
Publisher
BENTHAM SCIENCE PUBLISHERS
Related search
A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications
The Complexity of Constructing Pseudorandom Generators From Hard Functions
Computational Complexity
Mathematics
Computational Mathematics
Theoretical Computer Science
Computational Theory
Pseudorandom Generators
Robust Pseudorandom Generators
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Predicting Subset Sum Pseudorandom Generators
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Language Compression and Pseudorandom Generators
Computational Complexity
Mathematics
Computational Mathematics
Theoretical Computer Science
Computational Theory
Using Hard Problems to Create Pseudorandom Generators.
Mathematics of Computation
Computational Mathematics
Applied Mathematics
Number Theory
Algebra
Incomplete Exponential Sums Over Finite Fields and Their Applications to New Inversive Pseudorandom Number Generators
Acta Arithmetica
Number Theory
Algebra
Using Hard Problems to Create Pseudorandom Generators
