Almost Chor-Goldreich Sources and Adversarial Random Walks
D Doron, D Moshkovitz, J Oh… - Proceedings of the 55th …, 2023 - dl.acm.org
A Chor–Goldreich (CG) source is a sequence of random variables X= X 1∘…∘ X t, where
each X i∼{0, 1} d and X i has δ d min-entropy conditioned on any fixing of X 1∘…∘ X i− 1 …
each X i∼{0, 1} d and X i has δ d min-entropy conditioned on any fixing of X 1∘…∘ X i− 1 …
No time to hash: On super-efficient entropy accumulation
Real-world random number generators (RNGs) cannot afford to use (slow) cryptographic
hashing every time they refresh their state R with a new entropic input X. Instead, they use …
hashing every time they refresh their state R with a new entropic input X. Instead, they use …
On seedless prngs and premature next
Pseudorandom number generators with input (PRNGs) are cryptographic algorithms that
generate pseudorandom bits from accumulated entropic inputs (eg, keystrokes, interrupt …
generate pseudorandom bits from accumulated entropic inputs (eg, keystrokes, interrupt …
Cryptography: From Practice to Theory
H Karthikeyan - 2022 - search.proquest.com
This work is yet another attempt to turn an age-old adage on its head by deriving inspiration
for theoretical research from problems that are germane to practitioners and real-world …
for theoretical research from problems that are germane to practitioners and real-world …