Pages that link to "Item:Q3339289"
From MaRDI portal
The following pages link to How to Generate Cryptographically Strong Sequences of Pseudorandom Bits (Q3339289):
Displayed 50 items.
- Bounds on tradeoffs between randomness and communication complexity (Q687507) (← links)
- A short proof for explicit formulas for discrete logarithms in finite fields (Q802668) (← links)
- Constant-round perfect zero-knowledge computationally convincing protocols (Q808240) (← links)
- Bit commitment using pseudorandomness (Q808241) (← links)
- Pseudorandom bits for constant depth circuits (Q808707) (← links)
- Efficient, perfect polynomial random number generators (Q809536) (← links)
- Performance improvement for the GGM-construction of pseudorandom functions (Q864800) (← links)
- A note on computational indistinguishability (Q910218) (← links)
- A discrete logarithm implementation of perfect zero-knowledge blobs (Q913490) (← links)
- Probabilistic encryption (Q1057832) (← links)
- Generating quasi-random sequences from semi-random sources (Q1088641) (← links)
- Reductions among number theoretic problems (Q1091136) (← links)
- On the notion of infinite pseudorandom sequences (Q1091817) (← links)
- On using deterministic functions to reduce randomness in probabilistic algorithms (Q1094137) (← links)
- On solving hard problems by polynomial-size circuits (Q1095663) (← links)
- One-way functions and circuit complexity (Q1096587) (← links)
- One way functions and pseudorandom generators (Q1100894) (← links)
- Expanders, randomness, or time versus space (Q1107314) (← links)
- One-way permutations in NC 0 (Q1108786) (← links)
- An unpredictability approach to finite-state randomness (Q1117699) (← links)
- On the power of two-point based sampling (Q1120201) (← links)
- A study of password security (Q1121243) (← links)
- Random languages for nonuniform complexity classes (Q1179458) (← links)
- Local randomness in pseudorandom sequences (Q1180515) (← links)
- An introduction to randomized algorithms (Q1182319) (← links)
- Almost everywhere high nonuniform complexity (Q1190985) (← links)
- Multiparty protocols, pseudorandom generators for Logspace, and time- space trade-offs (Q1201152) (← links)
- Pseudorandom generators for space-bounded computation (Q1204523) (← links)
- A uniform-complexity treatment of encryption and zero-knowledge (Q1207696) (← links)
- A perfect zero-knowledge proof system for a problem equivalent to the discrete logarithm (Q1261018) (← links)
- Synthesizers and their application to the parallel construction of pseudo-random functions (Q1288205) (← links)
- Universal tests for nonuniform distributions (Q1310449) (← links)
- The discrete logarithm modulo a composite hides \(O(n)\) bits (Q1317484) (← links)
- Self-testing/correcting with applications to numerical problems (Q1317490) (← links)
- \(BPP\) has subexponential time simulations unless \(EXPTIME\) has publishable proofs (Q1321029) (← links)
- Randomness in interactive proofs (Q1321030) (← links)
- Provably good pattern generators for a random pattern test (Q1322559) (← links)
- The vulnerability of geometric sequences based on fields of odd characteristic (Q1324757) (← links)
- The power of adaptiveness and additional queries in random-self- reductions (Q1332664) (← links)
- Hardness vs randomness (Q1337458) (← links)
- On the hardness of computing the permanent of random matrices (Q1355377) (← links)
- Zeta functions, one-way functions, and pseudorandom number generators. (Q1362085) (← links)
- Optimal bounds for the approximation of Boolean functions and some applications (Q1390872) (← links)
- A random number generator based on elliptic curve operations (Q1433102) (← links)
- Resource bounded randomness and computational complexity (Q1566703) (← links)
- Protecting data privacy in private information retrieval schemes (Q1577014) (← links)
- Improved algorithms via approximations of probability distributions (Q1582012) (← links)
- Randomness vs time: Derandomization under a uniform assumption (Q1604214) (← links)
- A comparison of two approaches to pseudorandomness (Q1605323) (← links)
- Some consequences of the existnce of pseudorandom generators (Q1822961) (← links)