Crytographically Secure Pseudorandom Number Generation with Low Computational Requirements
RFT-261
An innovative cryptographically-secure pseudorandom number generation (PRNG) algorithm. Linear congruential generators (LCGs) are efficient algorithms which have been used to generate streams of pseudorandom numbers. However, these generators have been known to be cryptographically insecure. This implies that if a small sequence of numbers generated by an LCG is known, then it is possible to predict the remaining numbers in the sequence with relatively little effort. This NDSU technology solves this security problem by generating a cryptographically-secure pseudorandom bit sequence by coupling the outputs of two or more LCGs. This algorithm is significantly less computationally intensive than most existing security algorithms, such as the well-known and widely-used Blum Blum Shub algorithm. This efficiency allows the NDSU technology to be used in products and applications where security was previously a luxury due to the high processing burden of existing algorithms.
Downloads
File: rft-261.pdf
Inquiries
Jonathan L. Tolstedt
Licensing Associate/Patent Agent
NDSU Research Foundation
1735 NDSU Research Park Drive, Suite 124
Fargo, North Dakota 58105-5002
(701) 231-8173 Work
(701) 231-6661 Fax
www.ndsuresearchfoundation.org