Counting unpredictable bits: a simple PRG from one-way functions

DOI10.1007/978-3-031-48615-9_7MaRDI QIDQ6581788zbMATH OpenFDO

Authors Noam Mazor, Rafael Pass

Publication date 1 August 2024

Full work available at URL https://doi.org/10.1007/978-3-031-48615-9_7

zbMATH Keywords

pseudo-random generatorsGoldreich-Levin Theorem

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Theory of Cryptography
• Simple constructions from (almost) regular one-way functions
• Simple constructions from (almost) regular one-way functions
• The randomized iterate, revisited -- almost linear seed length PRGs from a broader class of one-way functions
• Efficiency improvements in constructing pseudorandom generators from one-way functions

Cites work

• A Pseudorandom Generator from any One-way Function
• Bit commitment using pseudorandomness
• Characterizing pseudoentropy and simplifying pseudorandom generator constructions
• Efficiency improvements in constructing pseudorandom generators from one-way functions
• How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
• Inaccessible entropy
• On the Cryptographic Applications of Random Functions (Extended Abstract)
• On the Power of the Randomized Iterate
• Probabilistic encryption
• The many entropies in one-way functions
• Theory of Cryptography

Cited in

(1)

• A direct PRF construction from Kolmogorov complexity

This page was built for publication: Counting unpredictable bits: a simple PRG from one-way functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6581788)