The randomized iterate, revisited -- almost linear seed length PRGs from a broader class of one-way functions

DOI10.1007/978-3-662-46494-6_2MaRDI QIDQ5261622zbMATH OpenOpenAlexFDO

Authors Yu Yu, Jian Weng, Dawu Gu, Xiangxue Li

Publication date 6 July 2015

Published in Theory of Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-46494-6_2

Mathematics Subject Classification ID

Random number generation in numerical analysis (65C10) Cryptography (94A60)

Recommendations

• Pseudorandom generators from regular one-way functions: new constructions with improved parameters
• On the Power of the Randomized Iterate
• On the Power of the Randomized Iterate
• Pseudorandom generators from regular one-way functions: new constructions with improved parameters
• Simple constructions from (almost) regular one-way functions

Cited in

(10)

• Paradigms for Unconditional Pseudorandom Generators
• A new pseudorandom generator from collision-resistant hash functions
• Counting unpredictable bits: a simple PRG from one-way functions
• On the Power of the Randomized Iterate
• On linear-size pseudorandom generators and hardcore functions
• On linear-size pseudorandom generators and hardcore functions
• Pseudorandom generators from regular one-way functions: new constructions with improved parameters
• Towards non-black-box separations of public key encryption and one way function
• Simple constructions from (almost) regular one-way functions
• Simple constructions from (almost) regular one-way functions

This page was built for publication: The randomized iterate, revisited -- almost linear seed length PRGs from a broader class of one-way functions

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