<--- Back to Details
First PageDocument Content
Pseudorandomness / Pseudorandom number generators / Computational complexity theory / Pseudorandom generator theorem / Pseudorandom generator / Randomized algorithm / Blum Blum Shub / Information theory / XTR / Theoretical computer science / Applied mathematics / Mathematics
Date: 2006-02-27 04:40:52
Pseudorandomness
Pseudorandom number generators
Computational complexity theory
Pseudorandom generator theorem
Pseudorandom generator
Randomized algorithm
Blum Blum Shub
Information theory
XTR
Theoretical computer science
Applied mathematics
Mathematics

Appears in Cryptography and Coding: 10th IMA International Conference, Lecture Notes in Computer Science[removed]–375. Springer-Verlag. Concrete Security of the Blum-Blum-Shub

Add to Reading List

Source URL: www.win.tue.nl

Download Document from Source Website

File Size: 254,52 KB

Share Document on Facebook

Similar Documents

Microsoft Word - Psalm 22.doc

Microsoft Word - Psalm 22.doc

DocID: 1reJW - View Document

On the Role of Definitions in and Beyond Cryptography Phillip Rogaway Dept. of Computer Science, University of California, Davis, California 95616, USA, and Dept. of Computer Science, Fac. of Science, Chiang Mai Universi

On the Role of Definitions in and Beyond Cryptography Phillip Rogaway Dept. of Computer Science, University of California, Davis, California 95616, USA, and Dept. of Computer Science, Fac. of Science, Chiang Mai Universi

DocID: 1q00z - View Document

Saving Private Randomness in One-Way Functions and Pseudorandom Generators Nenad Dedi´c∗ ‡ § Danny Harnik† §

Saving Private Randomness in One-Way Functions and Pseudorandom Generators Nenad Dedi´c∗ ‡ § Danny Harnik† §

DocID: 14P6B - View Document

CHENNAI MATHEMATICAL INSTITUTE M.Sc. / Ph.D. Programme in Computer Science Entrance Examination, 25 May 2012 This question paper has 5 printed sides. Part A has 10 questions of 3 marks each. Part B has 7 questions of 10

CHENNAI MATHEMATICAL INSTITUTE M.Sc. / Ph.D. Programme in Computer Science Entrance Examination, 25 May 2012 This question paper has 5 printed sides. Part A has 10 questions of 3 marks each. Part B has 7 questions of 10

DocID: 12R5V - View Document

Applications of Polynomial Properties to Verifiable Delegation of Computation and Electronic Voting Sandra Guasch Paz Morillo

Applications of Polynomial Properties to Verifiable Delegation of Computation and Electronic Voting Sandra Guasch Paz Morillo

DocID: 12QcG - View Document