First Page | Document Content | |
---|---|---|
![]() Date: 2005-11-03 17:27:07Mathematics Pseudorandom number generators Cryptography Binary arithmetic Linear feedback shift register BCH code Polynomial Cyclic code Berlekamp–Massey algorithm Coding theory Error detection and correction Finite fields | Source URL: crypto.stanford.eduDownload Document from Source WebsiteFile Size: 984,42 KBShare 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¨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 |