On the Complexity of Non-adaptively Increasing the Stretch of Pseudorandom Generators

DOI10.1007/978-3-642-19571-6_31zbMATH Open1295.94115OpenAlexW1570328602MaRDI QIDQ3000561FDOQ3000561

Emanuele Viola, Eric Miles

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_31

Recommendations

• Limits on the stretch of non-adaptive constructions of pseudo-random generators
• On the linear and nonlinear complexity profile of nonlinear pseudorandom number generators
• On pseudorandom generators with linear stretch in \(\mathrm{NC}^{0}\)
• On Pseudorandom Generators with Linear Stretch in NC0
• The complexity of constructing pseudorandom generators from hard functions
• scientific article; zbMATH DE number 5174819
• On the complexity of constructing pseudorandom functions (especially when they don't exist)
• On the linear complexity and lattice test of nonlinear pseudorandom number generators
• On the linear complexity profile of nonlinear congruential pseudorandom number generators of higher orders
• scientific article; zbMATH DE number 1424198

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (5)

• From non-adaptive to adaptive pseudorandom functions
• Homomorphic Evaluation Requires Depth
• On pseudorandom generators with linear stretch in \(\mathrm{NC}^{0}\)
• Structural lower bounds on black-box constructions of pseudorandom functions
• On Pseudorandom Generators with Linear Stretch in NC0

This page was built for publication: On the Complexity of Non-adaptively Increasing the Stretch of Pseudorandom Generators

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