Random Number Generator with Long Cycle Based on Memory Cells

Authors

  • Noman Alassali S Dept. Computer Engineering, University of Saba Region , Marib, Yemen
  • Mansour AL-Aqelee H Dept. Computer Engineering, University of Saba Region

DOI:

https://doi.org/10.26438/ijcse/v9i7.3540

Keywords:

spherical, memory cel, initial values, linear congruently

Abstract

Nowadays, random numbers become essential element in many activities. Random numbers can be used in several applications, like simulations, security systems, managements, financial operations, and so on. Indeed, there are many of random numbers generators ‘RNGs’ currently in used, but so far, there is no ideal one, and the requirement of RNGs are increased while the passed time. The main defects in the available RNGs are the short period of its repeat cycle length and also the predefined values of static factors as well. This research will try to suggest a method to extend the periodic cycle of the repetition, and to improve the quality of the generated numbers randomly. The main idea of this research is to build spherical structure to become memory cells that contain initial random numbers, using a combination of two linear congruently generators. Every cell contains one number. Generating any random number takes place by determining the memory cell index found on spherical structure and make the generation of any random number affects the values of many cells of its neighbors, and also affected by the values of many cells randomly. The spherical structure can be represented by three dimensions matrix, with suitable sizes’ not less than 10, 10, 10,.

References

[1] William Stallings, “Cryptography and Network Security: Principles and Practice” 3rd Ed. India Reprint. Agrawal-M IETE-Technical-Review. 2009.

[2] Jerry Banks, etc.., "Discrete-Event System Simulation", 3th Ed. Pearson Education, Singapore. 2001.

[3] Bruce Schneier, “Applied Cryptography” 3rd Edition John Wiley & Sons. (ASIA) Pvt. Ltd., 2 Clementi Loop # 02-01, Singapore 129809. 2010.

[4] Borosh. S., and Niederreiter, H., "Optimal Multipliers For Pseudo-Random Number Generation By The Linear Congruential Method", BIT 23,65-74. 1983.

[5] Figiel, K.D., and Sule. D.R., "New Lagged Product Test for Random Number Generators". Comput. Ind. Eng. Vol. 9, 287-296, Mar. 1985.

[6] P. L’Ecuyer, “Efficient and portable combined random number generators”, Communications of the ACM 31 Volume 31 Number 6, USA, June 1988

Downloads

Published

2021-07-31
CITATION
DOI: 10.26438/ijcse/v9i7.3540
Published: 2021-07-31

How to Cite

[1]
S. Noman Alassali and H. Mansour AL-Aqelee, “Random Number Generator with Long Cycle Based on Memory Cells”, Int. J. Comp. Sci. Eng., vol. 9, no. 7, pp. 35–40, Jul. 2021.

Issue

Section

Research Article