Using Hard Problems to Create Pseudorandom Generators.

Mathematics of Computation - United States
doi 10.2307/2153144
Full Text
Abstract

Available in full text

Date
Authors
Publisher

JSTOR

Related search

Using Hard Problems to Create Pseudorandom Generators

1992English

Pseudorandom Generators

English

The Complexity of Constructing Pseudorandom Generators From Hard Functions

Computational Complexity
MathematicsComputational MathematicsTheoretical Computer ScienceComputational Theory
2005English

Robust Pseudorandom Generators

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

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

Statistical Complexity of Chaotic Pseudorandom Number Generators

2013English

Method for Assessing the Quality of Cryptosecure Pseudorandom Sequence Generators

Voprosy kiberbezopasnosti
2018English

Incomplete Exponential Sums Over Finite Fields and Their Applications to New Inversive Pseudorandom Number Generators

Acta Arithmetica
Number TheoryAlgebra
2000English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy