An Improved Pseudorandom Generator Based on Hardness of Factoring Nenad Dedi´c Boston University

First Page		Document Content
Date: 2002-08-27 12:28:51 Pseudorandomness Pseudorandom number generators Computational complexity theory Algorithmic information theory Pseudorandom generator Hard-core predicate XTR One-way function Naor-Reingold Pseudorandom Function Theoretical computer science Cryptography Applied mathematics		An Improved Pseudorandom Generator Based on Hardness of Factoring Nenad Dedi´c Boston University Add to Reading List Source URL: eprint.iacr.org Download Document from Source Website File Size: 162,54 KB Share Document on Facebook

	Microsoft Word - Psalm 22.doc DocID: 1reJW - View Document
	HP Prime Technology Corner 10 The Practice of Statistics for the AP Exam, 5e Section 4-1, P. 215 TECHNOLOGY CORNER 10. Choosing an SRS on the HP Prime DocID: 1r25i - View Document
	Hoti to Construct Random Functions ODED GOLDREICH, SHAFI AND SILVIO MICALI GOLDWASSER, DocID: 1r1z1 - View Document
	Network Working Group Request for Comments: 4086 BCP: 106 Obsoletes: 1750 Category: Best Current Practice DocID: 1qWaS - View Document
	Lossless Condensers, Unbalanced Expanders, and Extractors Amnon Ta-Shma∗ Christopher Umans† David Zuckerman‡ DocID: 1qPOU - View Document