Pages that link to "Item:Q2819543"

The following pages link to On recycling the randomness of states in space bounded computation (Q2819543):

Displaying 19 items.

• Pseudorandom generators for combinatorial checkerboards (Q395607) (← links)
• Weak derandomization of weak algorithms: explicit versions of Yao's lemma (Q451107) (← links)
• Non-interactive timestamping in the bounded-storage model (Q1015360) (← links)
• Storing information with extractors. (Q1853081) (← links)
• Security analysis of NIST CTR-DRBG (Q2096485) (← links)
• No time to hash: on super-efficient entropy accumulation (Q2139648) (← links)
• Big-Key Symmetric Encryption: Resisting Key Exfiltration (Q2835594) (← links)
• On Probabilistic Space-Bounded Machines with Multiple Access to Random Tape (Q2946415) (← links)
• On the distribution of the number of roots of polynomials and explicit weak designs (Q4431434) (← links)
• Pseudorandomness via the Discrete Fourier Transform (Q4562280) (← links)
• Preserving Randomness for Adaptive Algorithms (Q5009539) (← links)
• (Q5092476) (← links)
• Pseudorandom Pseudo-distributions with Near-Optimal Error for Read-Once Branching Programs (Q5130845) (← links)
• Optimal $\varepsilon$-Biased Sets with Just a Little Randomness (Q5499738) (← links)
• Targeted Pseudorandom Generators, Simulation Advice Generators, and Derandomizing Logspace (Q5856147) (← links)
• Extracting all the randomness and reducing the error in Trevisan's extractors (Q5917498) (← links)
• Improved Explicit Hitting-Sets for ROABPs (Q6084347) (← links)
• A forkcipher-based pseudo-random number generator (Q6535108) (← links)
• Security analysis of the ISO standard \textsf{OFB}-\textsf{DRBG} (Q6632048) (← links)