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.
- 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)
- One-message zero knowledge and non-malleable commitments (Q1629409) (← links)
- Pseudorandom bit sequence generator for stream cipher based on elliptic curves (Q1665107) (← links)
- Polynomial interpolation and identity testing from high powers over finite fields (Q1709581) (← links)
- Some consequences of the existnce of pseudorandom generators (Q1822961) (← links)
- Fast generation of prime numbers and secure public-key cryptographic parameters. (Q1895963) (← links)
- Mathematical problems in cryptology (Q1910812) (← links)
- One-way functions using algorithmic and classical information theories (Q1946513) (← links)
- Practical chosen ciphertext secure encryption from factoring (Q1946594) (← links)
- Cryptanalysis of the stream cipher LEX (Q1949239) (← links)
- Worst-case hardness suffices for derandomization: a new method for hardness-randomness trade-offs (Q1960516) (← links)
- Secure remote state estimation against linear man-in-the-middle attacks using watermarking (Q2003830) (← links)
- Fourier concentration from shrinkage (Q2012185) (← links)
- Traceable ring signatures: general framework and post-quantum security (Q2034982) (← links)
- Single-to-multi-theorem transformations for non-interactive statistical zero-knowledge (Q2061955) (← links)
- On the existence of pairs of primitive normal elements over finite fields (Q2107674) (← links)
- A brief and understandable guide to pseudo-random number generators and specific models for security (Q2137825) (← links)
- MPC-friendly symmetric cryptography from alternating moduli: candidates, protocols, and applications (Q2139646) (← links)
- A note on perfect correctness by derandomization (Q2146431) (← links)
- A survey on delegated computation (Q2163976) (← links)
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification (Q2232597) (← links)
- Algorithmic rationality: game theory with costly computation (Q2253839) (← links)
- Simple extractors via constructions of cryptographic pseudo-random generators (Q2268098) (← links)
- Bounds on the efficiency of black-box commitment schemes (Q2268099) (← links)
- Realistic analysis of some randomized algorithms (Q2277019) (← links)
- One-way permutations on elliptic curves (Q2277234) (← links)
- Proving that \(\mathrm{prBPP}=\mathrm{prP}\) is as hard as proving that ``almost NP'' is not contained in P/poly (Q2328311) (← links)
- Mining circuit lower bound proofs for meta-algorithms (Q2351392) (← links)
- Unifying known lower bounds via geometric complexity theory (Q2351393) (← links)
- More efficient DDH pseudorandom generators (Q2380399) (← links)