Design of Cryptographically Strong generator By Transforming Linearly Generated Sequences
by
Matthew Anyanwu
Department of Computer Science, University of Memphis, Memphis TN 38152
Coauthors: Lih-Yuan Deng and Dasgupta Dipankar

Random numbers have been used extensively in many simulation applications like Monte Carlo Integration or for computer modeling.But recently security applications have increased the need for secure and strong random number generation like automatic password generation and on-line gambling. Thus random number generation has become a challenging and an interesting task. Most classical random number generators generate sequences that are either linear and predictable hence not suitable for cryptographic and security applications. Others generate sequences that even though they are secure they are not cryptographically strong and above all are slow in execution. Also recent advances in random number generation like the construction of Multiple Recursive Generator (MRGs) with large orders and Fast MRGs does not generate a strong and secure random number sequences. Though MRGs have extremely long period of length, its recurrence equation can be solved given a small set of its generated sequence,this implies that MRGs and fast MRGS are not strong and secure cryptographic generators. We propose and algorithm that will transform linear sequences generated by both classical, MRGS and fast MRGs and make them cryptographically strong and secure generators, that will be dicult for cryptanalyst to predict or infer.

Date received: February 29, 2008

Copyright © 2008 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # cawu-65.