Computational indistinguishability: A sample hierarchy
type: Item
instance of: scholarly article
title: Computational indistinguishability: A sample hierarchy
zbMATH Open document ID: 0947.68066
author: Oded Goldreich
author: Madhu Sudan
published in: Journal of Computer and System Sciences
publication date: 2000-01-17T00:00:00Z
Mathematics Subject Classification ID: 68Q15
zbMATH DE Number: 1389786
zbMATH Keywords: computational indistinguishability
zbMATH Keywords: polynomials
zbMATH Keywords: extractors
zbMATH Keywords: expanders
zbMATH Keywords: eigenvalues
zbMATH Keywords: rapid mixing
MaRDI profile type: Publication
cites work: Q4004078
cites work: The eigenvalues of random symmetric matrices
cites work: Q3729902
cites work: Computational indistinguishability: algorithms vs. circuits
cites work: Probabilistic encryption
cites work: Fast Probabilistic Algorithms for Verification of Polynomial Identities
cites work: New Algorithms for Finding Irreducible Polynomials Over Finite Fields
cites work: Q4372786
description: scientific article; zbMATH DE number 1389786