First Page | Document Content | |
---|---|---|
Date: 2015-05-13 01:17:02Random number generation Entropy /dev/random Min-entropy Key Random number Randomness extractor Cryptographically secure pseudorandom number generator Randomness Cryptography Applied mathematics | Randomness: between faith and reality Yaoyun Shi University of Michigan joint works with Carl Miller (arXiv:&), Kai-Min Chung and Xiaodi Wu (arXiv:)Add to Reading ListSource URL: web.eecs.umich.eduDownload Document from Source WebsiteFile Size: 4,03 MBShare Document on Facebook |
Why Simple Hash Functions Work: Exploiting the Entropy in a Data Stream∗ Michael Mitzenmacher† Salil Vadhan‡ School of Engineering & Applied Sciences Harvard UniversityDocID: 1r5sy - View Document | |
Why Simple Hash Functions Work: Exploiting the Entropy in a Data StreamDocID: 1qUBE - View Document | |
Lossless Condensers, Unbalanced Expanders, and Extractors Amnon Ta-Shma∗ Christopher Umans† David Zuckerman‡DocID: 1qPOU - View Document | |
Simple Extractors for All Min-Entropies and a New Pseudorandom Generator∗ Ronen Shaltiel † Christopher Umans ‡DocID: 1qB1P - View Document | |
LNCSOur Data, Ourselves: Privacy Via Distributed Noise GenerationDocID: 1pOcL - View Document |