Using Hard Problems to Create Pseudorandom Generators
ACM Distinguished Dissertations
1982
Abstraction Mechanisms and Language Design, Paul N. Hillinger
Formal Specification ofInteractive Graphics Programming Language, William R. Mallgren
Algorithmic Program Debu8lint, Ehud Y. Shapiro
1983
The Measurement of Visual Motion, Ellen Catherine Hildreth
Synthesis of Digital Designs from Recursion Equations. Steven D. Johnson
1984
Analytic Methods In the Analysis and Design ofNumber-Theoretic Algorithms, Eric Bach
Model-Based Image Matching Using Location, Henry S. Baird
A Geometric InrJestigation ofReach. James U. Korein
1985
Two IB8ues in Public-Key Cryptography, Ben-Zion Chor
The Connection Machine. W. Daniel Hillis
1988
All the Right MOrJes: A VLSI Architecture for Chess, Carl Ebeling
The Design and Evaluation of a High Performance Smalltalk System, David Michael Ungar
1987
Algorithm Animation, Marc H. Brown
The Rapid ErJaluation ofPotential nelda in Particle Systems, Leslie Greengard
1988
Computational Models of Games, Anne Condon
Trace Theory for Automatic Hierarchical Verification of Speed-Independent Circuits, David
L. Dill
1989
The Computational Complexity ofMachine Learning, Michael J. Kearns
Uses ofRandomness in Algorithms and Protocols, Joe Kilian
1990
Using Hard Problem. to Create Pseudorandom Generators, Noam Nisan
Using Hard Problems to Create Pseudorandom Generators
Noam Nisan
The MIT Press
Cambridge, Massachusetts
London, Englaud
C1992 Muaacbuaettalnstitute of Technology
All rights reaemd. No part of thia book may be reproduced in any form b)' any electronic or mechanical
1DeaJI.I (including photocopying, recording, or information atoraga and retrieval) without permie,aion in
writing from the publisher.
This book was let in TaX by the author and was
printed and bound in the United Statea of America.
Library of CoDgnllla Cataloging-in-Publication Data
Niaan,Noam
Using hard problema to create paeudorandGm generators I Noam Niaan.
p. em. (ACM diatinguiahad diaaertationa)
Reviaion of the author's thelia (Ph. D.)-Unlvenity of California, Berkeley,
).
Includes bibliographical referencea (p.
-
ISBN 0-262·14051-9
1. Random number seneratora. 2.
QA298.NI57 1991
519.4-dc20
ISBN 0-262-64052-X
(paperback)
Computational complezity.
1988.
I. Title. n. Seriel.
91-40779
CIP