Pages that link to "Item:Q3339289"
From MaRDI portal
The following pages link to How to Generate Cryptographically Strong Sequences of Pseudorandom Bits (Q3339289):
Displaying 50 items.
- Quantum cryptography. II: How to re-use a one-time pad safely even if \(\mathrm P=\mathrm{NP}\) (Q268457) (← links)
- Linear complexity of the \(x^{2} \bmod p\) orbits (Q294691) (← links)
- Garbling XOR gates ``for free'' in the standard model (Q315547) (← links)
- A counterexample to the chain rule for conditional HILL entropy (Q332268) (← links)
- Unprovable security of perfect NIZK and non-interactive non-malleable commitments (Q332270) (← links)
- Paillier's trapdoor function hides \(\Theta(n)\) bits (Q350942) (← links)
- Improving classical authentication over a quantum channel (Q406240) (← links)
- Computational indistinguishability between quantum states and its cryptographic application (Q434349) (← links)
- Weak derandomization of weak algorithms: explicit versions of Yao's lemma (Q451107) (← links)
- When can limited randomness be used in repeated games? (Q506541) (← links)
- Small-bias is not enough to hit read-once CNF (Q519906) (← links)
- Wavelet-based image watermarking with visibility range estimation based on HVS and neural networks (Q621068) (← links)
- Derandomizing Arthur-Merlin games and approximate counting implies exponential-size lower bounds (Q645124) (← links)
- Immunity and pseudorandomness of context-free languages (Q653340) (← links)
- Bounds on tradeoffs between randomness and communication complexity (Q687507) (← links)
- The complexity of explicit constructions (Q693069) (← links)
- QUAD: A multivariate stream cipher with provable security (Q733512) (← links)
- On linear-size pseudorandom generators and hardcore functions (Q744085) (← 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)
- Practical isogeny-based key-exchange with optimal tightness (Q832367) (← links)
- Generic complexity of Presburger arithmetic (Q848747) (← links)
- Performance improvement for the GGM-construction of pseudorandom functions (Q864800) (← links)
- Pseudorandom generators against advised context-free languages (Q899305) (← links)
- A note on computational indistinguishability (Q910218) (← links)
- A discrete logarithm implementation of perfect zero-knowledge blobs (Q913490) (← links)
- Reducing complexity assumptions for statistically-hiding commitment (Q1027978) (← links)
- Cryptography with constant input locality (Q1037233) (← 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)
