L. Kocarev and G. Jakimoski, “Pseudo-Random Bits Generated by Chaotic Maps,” IEEE Transactions on Circuits and Systems, Vol. 50, No. 1, 2003, pp. 123-126. doi:10.1109/TCSI.2002.804550

has been cited by the following article:

• TITLE: Improving Middle Square Method RNG Using Chaotic Map

  AUTHORS: Hamed Rahimov, Majid Babaie, Hassan Hassanabadi

  KEYWORDS: Middle Square Method (MSM), Random Number Generator, Logistic Map, NIST Tests Suite

  JOURNAL NAME: Applied Mathematics, Vol.2 No.4, March 31, 2011

  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.