Pseudo-Random Generator Based on Chinese Remainder Theorem Jean Claude Bajard and Heinrich H¨ordegen LIRMM Univ. Montpellier 2 UMR CNRS, France ABSTRACT Pseudo-Random Generators (PRG) are fundamental in cryptography. Th

First Page		Document Content
Date: 2014-05-19 07:36:07 Theoretical computer science Pseudorandom number generators Algorithmic information theory Pseudorandomness Random number generation Randomness tests Diehard tests TestU01 Linear feedback shift register Randomness Cryptography Applied mathematics		Pseudo-Random Generator Based on Chinese Remainder Theorem Jean Claude Bajard and Heinrich H¨ordegen LIRMM Univ. Montpellier 2 UMR CNRS, France ABSTRACT Pseudo-Random Generators (PRG) are fundamental in cryptography. Th Add to Reading List Source URL: 78.47.219.106 Download Document from Source Website File Size: 110,83 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