Pages that link to "Item:Q1100894"
From MaRDI portal
The following pages link to One way functions and pseudorandom generators (Q1100894):
Displayed 20 items.
- Prediction-preserving reducibility (Q756441) (← links)
- One-way functions and circuit complexity (Q1096587) (← links)
- One-way permutations in NC 0 (Q1108786) (← links)
- On the theory of average case complexity (Q1190984) (← links)
- Almost everywhere high nonuniform complexity (Q1190985) (← links)
- \(BPP\) has subexponential time simulations unless \(EXPTIME\) has publishable proofs (Q1321029) (← links)
- Randomness vs time: Derandomization under a uniform assumption (Q1604214) (← links)
- Symmetry of information and one-way functions (Q1802066) (← links)
- Some consequences of the existnce of pseudorandom generators (Q1822961) (← links)
- Shared generation of pseudo-random functions (Q1827581) (← links)
- One-way permutations and self-witnessing languages (Q1877694) (← links)
- Mathematical problems in cryptology (Q1910812) (← links)
- On-line/off-line digital signatures (Q1912770) (← links)
- Practical construction and analysis of pseudo-randomness primitives (Q2482337) (← links)
- Pseudorandom sources for BPP (Q2641105) (← links)
- Sparse pseudorandom distributions (Q3990219) (← links)
- The complexity of ODD<sub><i>n</i></sub><sup><i>A</i></sup> (Q4953205) (← links)
- Basing Weak Public-Key Cryptography on Strong One-Way Functions (Q5445498) (← links)
- Degradation and Amplification of Computational Hardness (Q5445529) (← links)
- Easiness assumptions and hardness tests: Trading time for zero error (Q5956013) (← links)