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

	Pseudorandom Number Generators for Cryptographic Applications Diplomarbeit zur Erlangung des Magistergrades an der Naturwissenschaftlichen Fakult¨at der Paris-Lodron-Universit¨at Salzburg Andrea R¨ock DocID: 1tghr - View Document
	Motivations PRNG Security Model Java SecureRandom Analysis DocID: 1rmDv - View Document
	Network Working Group Request for Comments: 4086 BCP: 106 Obsoletes: 1750 Category: Best Current Practice DocID: 1qWaS - View Document
	The Somewhat Simplified Solitaire Encryption Algorithm Overview: In Neal Stephenson’s novel Cryptonomicon, two of the main characters are able to covertly communicate with one another with a deck of playing cards (incl DocID: 1qAir - View Document
	Microsoft Word - IBSS&K Engineering.doc DocID: 1qpK0 - View Document