On Linear-Size Pseudorandom Generators and Hardcore Functions

DOI10.1007/978-3-642-38768-5_17zbMath1381.94061OpenAlexW1766878465MaRDI QIDQ4925235

Joshua Baron, Rafail Ostrovsky, Yuval Ishai

Publication date: 11 June 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38768-5_17

zbMATH Keywords

pairwise independencecircuit complexitypseudorandom generatorshardcore functionsbilinear hash familiesexponential hardness

Mathematics Subject Classification ID

Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Pseudo-random numbers; Monte Carlo methods (11K45)

This page was built for publication: On Linear-Size Pseudorandom Generators and Hardcore Functions