<--- Back to Details
First PageDocument Content
Pseudorandomness / Pseudorandom number generators / Computational complexity theory / Algorithmic information theory / Pseudorandom generator / Blum Blum Shub / RC4 / Naor-Reingold Pseudorandom Function / Theoretical computer science / Cryptography / Applied mathematics
Date: 2007-09-27 11:26:00
Pseudorandomness
Pseudorandom number generators
Computational complexity theory
Algorithmic information theory
Pseudorandom generator
Blum Blum Shub
RC4
Naor-Reingold Pseudorandom Function
Theoretical computer science
Cryptography
Applied mathematics

Add to Reading List

Source URL: www.cs.princeton.edu

Download Document from Source Website

File Size: 142,32 KB

Share Document on Facebook

Similar Documents

Microsoft Word - Psalm 22.doc

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

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,

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

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‡

Lossless Condensers, Unbalanced Expanders, and Extractors Amnon Ta-Shma∗ Christopher Umans† David Zuckerman‡

DocID: 1qPOU - View Document