Predicting Subset Sum Pseudorandom Generators

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-540-30564-4_17
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Pseudorandom Generators

English

Robust Pseudorandom Generators

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

Language Compression and Pseudorandom Generators

Computational Complexity
MathematicsComputational MathematicsTheoretical Computer ScienceComputational Theory
2005English

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

Chosen-Ciphertext Security From Subset Sum

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2016English

The Complexity of Constructing Pseudorandom Generators From Hard Functions

Computational Complexity
MathematicsComputational MathematicsTheoretical Computer ScienceComputational Theory
2005English

Approximability of the Subset Sum Reconfiguration Problem

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy