Limits on the stretch of non-adaptive constructions of pseudo-random generators

DOI10.1007/978-3-642-19571-6_30zbMATH Open1295.94029OpenAlexW1807095039MaRDI QIDQ3000560FDOQ3000560

Authors: Josh Bronson, Ali Juma, Periklis A. Papakonstantinou 

Publication date: 19 May 2011

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

Full work available at URL: https://doi.org/10.1007/978-3-642-19571-6_30

Recommendations

• On the Complexity of Non-adaptively Increasing the Stretch of Pseudorandom Generators
• On the complexity of constructing pseudorandom functions (especially when they don't exist)
• On pseudorandom generators with linear stretch in \(\mathrm{NC}^{0}\)
• On Pseudorandom Generators with Linear Stretch in NC0
• Pseudo-random generators for all hardnesses

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (3)

• From non-adaptive to adaptive pseudorandom functions
• On the Complexity of Non-adaptively Increasing the Stretch of Pseudorandom Generators
• On the complexity of constructing pseudorandom functions (especially when they don't exist)

This page was built for publication: Limits on the stretch of non-adaptive constructions of pseudo-random generators

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