Journal of Northeastern University ›› 2006, Vol. 27 ›› Issue (8): 863-866.DOI: -

• OriginalPaper • Previous Articles     Next Articles

Random number generator based on weierstrass function

Zhang, Xiang-De (1); Zhu, He-Gui (1); Ding, Chun-Yan (1)   

  1. (1) School of Sciences, Northeastern University, Shenyang 110004, China
  • Received:2013-06-23 Revised:2013-06-23 Online:2006-08-15 Published:2013-06-23
  • Contact: Zhang, X.-D.
  • About author:-
  • Supported by:
    -

Abstract: The effects of what values the a, b, x take in the Weierstrass function ∑ai cos(biπx) on the randomness of the sequence {xn} are studied. It is proved that it will generate an unpredictable good random sequence {xn} when b>1. Then, a random number generator is designed for data encryption. Compared with other generators, it has several merits such as the unpredictability of the sequence, bigger secret key space, smaller storage space, simpler algorithm and easier to implement in addition to its long period, quick running speed, high compatibility and reproducibility of good randomness. The security of random number generator is thus enhanced, to a certain extent, thus meeting the requirements of a high-performance generator.

CLC Number: