On Pseudorandom Generators with Linear Stretch in NC0

DOI10.1007/11830924_25zbMATH Open1155.94363OpenAlexW1599258069MaRDI QIDQ3595413FDOQ3595413

Eyal Kushilevitz, Benny Applebaum, Yuval Ishai

Publication date: 28 August 2007

Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11830924_25

Mathematics Subject Classification ID

Cryptography (94A60) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cited In (8)

• On the \(\mathbb{F}_2\)-linear relations of Mersenne Twister pseudorandom number generators
• On the Complexity of Non-adaptively Increasing the Stretch of Pseudorandom Generators
• Multi-party homomorphic secret sharing and sublinear MPC from sparse LPN
• On the security of Goldreich's one-way function
• Title not available (Why is that?)
• Cryptography with constant input locality
• Computational fuzzy extractors
• A systematic study of sparse LWE

This page was built for publication: On Pseudorandom Generators with Linear Stretch in NC0

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