<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2004-12-10 07:50:23Applied mathematics Pseudorandom number generators Information theory Blum Blum Shub Random number generation Entropy Prime number Fortuna Fisher–Yates shuffle Cryptography Randomness Mathematics |
| Pseudorandom Number Generators for Cryptographic Applications Diplomarbeit zur Erlangung des Magistergrades an der Naturwissenschaftlichen Fakult¨at der Paris-Lodron-Universit¨at Salzburg Andrea R¨ockDocID: 1tghr - View Document |
| Motivations PRNG Security Model Java SecureRandom AnalysisDocID: 1rmDv - View Document |
| Network Working Group Request for Comments: 4086 BCP: 106 Obsoletes: 1750 Category: Best Current PracticeDocID: 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 (inclDocID: 1qAir - View Document |
| Microsoft Word - IBSS&K Engineering.docDocID: 1qpK0 - View Document |