Stretching demi-bits and nondeterministic-secure pseudorandomness
From MaRDI portal
Cites work
- A Pseudorandom Generator from any One-way Function
- Characterizing average-case complexity of PH by worst-case meta-complexity
- Derandomization in Cryptography
- Dual weak pigeonhole principle, pseudo-surjective functions, and provability of circuit lower bounds
- Foundations of Cryptography
- Graph Nonisomorphism Has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses
- Hardness vs randomness
- How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
- scientific article; zbMATH DE number 861531 (Why is no real title available?)
- scientific article; zbMATH DE number 7650416 (Why is no real title available?)
- Instance-wise hardness versus randomness tradeoffs for Arthur-Merlin protocols
- Natural proofs
- On one-way functions and Kolmogorov complexity
- Power from Random Strings
- Probabilistic encryption
- Pseudorandom generators hard for \(k\)-DNF resolution and polynomial calculus resolution
- Pseudorandom Generators in Propositional Proof Complexity
- RSA and Rabin Functions: Certain Parts are as Hard as the Whole
- Simple extractors for all min-entropies and a new pseudorandom generator
- Why are proof complexity lower bounds hard?
This page was built for publication: Stretching demi-bits and nondeterministic-secure pseudorandomness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6906331)
