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 26 items.
- Fast generation of prime numbers and secure public-key cryptographic parameters. (Q1895963) (← links)
- Mathematical problems in cryptology (Q1910812) (← links)
- Worst-case hardness suffices for derandomization: a new method for hardness-randomness trade-offs (Q1960516) (← links)
- Realistic analysis of some randomized algorithms (Q2277019) (← links)
- One-way permutations on elliptic curves (Q2277234) (← links)
- On pseudorandomness in families of sequences derived from the Legendre symbol (Q2460689) (← links)
- The reactive simulatability (RSIM) framework for asynchronous systems (Q2464139) (← links)
- Practical construction and analysis of pseudo-randomness primitives (Q2482337) (← links)
- Logics for reasoning about cryptographic constructions (Q2490263) (← links)
- Universal test for quantum one-way permutations (Q2575756) (← links)
- Pseudorandom sources for BPP (Q2641105) (← links)
- The index calculus method using non-smooth polynomials (Q2719078) (← links)
- QUAD: A Practical Stream Cipher with Provable Security (Q3593092) (← links)
- Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles (Q3600229) (← links)
- A New Attack on the LEX Stream Cipher (Q3600396) (← links)
- The Monte Carlo Algorithm with a Pseudorandom Generator (Q3987938) (← links)
- Sparse pseudorandom distributions (Q3990219) (← links)
- Gauss periods: orders and cryptographical applications (Q4372701) (← links)
- Generation of solved instances of Multiconstraint Knapsack problem and its applications to Private Key Cipher (Q4718638) (← links)
- Asymptotically Efficient Lattice-Based Digital Signatures (Q5445497) (← links)
- NONDETERMINISTIC CIRCUIT MINIMIZATION PROBLEM AND DERANDOMIZING ARTHUR-MERLIN GAMES (Q5714674) (← links)
- Natural proofs (Q5906823) (← links)
- Pseudo-random generators for all hardnesses (Q5917585) (← links)
- Computational sample complexity and attribute-efficient learning (Q5918064) (← links)
- Pseudorandom generators without the XOR lemma (Q5943089) (← links)
- Cryptographic limitations on parallelizing membership and equivalence queries with applications to random-self-reductions (Q5958646) (← links)