Amanote Research
Register
Sign In
Using Hard Problems to Create Pseudorandom Generators
doi 10.7551/mitpress/7052.001.0001
Full Text
Open PDF
Abstract
Available in
full text
Date
January 1, 1992
Authors
Noam Nisan
Publisher
The MIT Press
Related search
Using Hard Problems to Create Pseudorandom Generators.
Mathematics of Computation
Computational Mathematics
Applied Mathematics
Number Theory
Algebra
Pseudorandom Generators
The Complexity of Constructing Pseudorandom Generators From Hard Functions
Computational Complexity
Mathematics
Computational Mathematics
Theoretical Computer Science
Computational Theory
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
Statistical Complexity of Chaotic Pseudorandom Number Generators
Method for Assessing the Quality of Cryptosecure Pseudorandom Sequence Generators
Voprosy kiberbezopasnosti
Incomplete Exponential Sums Over Finite Fields and Their Applications to New Inversive Pseudorandom Number Generators
Acta Arithmetica
Number Theory
Algebra
