Improving Middle Square Method RNG Using Chaotic Map

HTML  Download Download as PDF (Size: 306KB)  PP. 482-486  
DOI: 10.4236/am.2011.24062    6,969 Downloads   13,066 Views  Citations

Affiliation(s)

.

ABSTRACT

One of the classic approaches in PRNGs is the middle square method in which with a simple mathe-matical model generating pseudorandom numbers in high speed and minimum correlation between output numbers. Despite these unique characteristics, the method contains weaknesses that a broader application of this algo- rithm will face. In this paper is studied middle square method and then a logistic chaotic map is introduced with its specific features and its improved weaknesses via using these characteristics. Finally the NIST tests suite s are presented, in order to detect the specific characteristics expected from truly random sequences.

Share and Cite:

H. Rahimov, M. Babaie and H. Hassanabadi, "Improving Middle Square Method RNG Using Chaotic Map," Applied Mathematics, Vol. 2 No. 4, 2011, pp. 482-486. doi: 10.4236/am.2011.24062.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.