On linear-size pseudorandom generators and hardcore functions
type: Item
instance of: scholarly article
title: On linear-size pseudorandom generators and hardcore functions
zbMATH Open document ID: 1384.94032
author: Joshua Baron
author: Yuval Ishai
author: Rafail Ostrovsky
published in: Theoretical Computer Science
publication date: 2014-10-06T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 11K45
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 6351424
zbMATH Keywords: cryptography
zbMATH Keywords: circuit complexity
zbMATH Keywords: pseudorandom generators
zbMATH Keywords: one-way functions
MaRDI profile type: Publication
full work available at URL: j.tcs.2014.06.013
OpenAlex ID: W2043814918
cites work: Exponential lower bounds for the running time of DPLL algorithms on satisfiable formulas
cites work: Pseudorandom generators with long stretch and low locality from random local one-way functions
cites work: Cryptography in $NC^0$
cites work: On pseudorandom generators with linear stretch in \(\mathrm{NC}^{0}\)
cites work: How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
cites work: On the Security of Goldreich’s One-Way Function
cites work: Goldreich’s One-Way Function Candidate and Myopic Backtracking Algorithms
cites work: Foundations of Cryptography
cites work: On the Existence of Pseudorandom Generators
cites work: Efficient Pseudorandom Generators from Exponentially Hard One-Way Functions
cites work: On the Power of the Randomized Iterate
cites work: Efficiency improvements in constructing pseudorandom generators from one-way functions
cites work: A Pseudorandom Generator from any One-way Function
cites work: Theory of Cryptography
cites work: Advances in Cryptology – CRYPTO 2004
cites work: Q3549728
cites work: Q2757258
cites work: Characterizing pseudoentropy and simplifying pseudorandom generator constructions
DOI: 10.1016/J.TCS.2014.06.013
description: scientific article; zbMATH DE number 6351424