![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 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](https://www.pdfsearch.io/img/da2e9461f48359066f0148a526dd0d9c.jpg) Date: 2002-08-27 12:28:51Pseudorandomness 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 ListSource URL: eprint.iacr.orgDownload Document from Source Website File Size: 162,54 KBShare Document on Facebook
|