The Complexity of Constructing Pseudorandom Generators From Hard Functions

Computational Complexity - Switzerland
doi 10.1007/s00037-004-0187-1
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

Statistical Complexity of Chaotic Pseudorandom Number Generators

2013English

Using Hard Problems to Create Pseudorandom Generators.

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
1993English

Using Hard Problems to Create Pseudorandom Generators

1992English

Pseudorandom Generators

English

Robust Pseudorandom Generators

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

Moderately Hard Functions: From Complexity to Spam Fighting

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2003English

Predicting Subset Sum Pseudorandom Generators

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

Language Compression and Pseudorandom Generators

Computational Complexity
MathematicsComputational MathematicsTheoretical Computer ScienceComputational Theory
2005English

Pseudorandom Functions and Lattices

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy