Open AccessImproving Middle Square Method RNG Using Chaotic Map
Author(s) -
H. Rahimov,
Majid Babaie,
H. Hassanabadi
Publication year - 2011
Publication title -
applied mathematics
Language(s) - English
Resource type - Journals
eISSN - 2152-7393
pISSN - 2152-7385
DOI - 10.4236/am.2011.24062
Subject(s) - nist , chaotic , pseudorandom number generator , square (algebra) , logistic map , simple (philosophy) , suite , computer science , strengths and weaknesses , random number generation , algorithm , mathematics , artificial intelligence , statistics , geometry , speech recognition , geography , philosophy , archaeology , epistemology
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