The week's pick
Reseach Article
Generating Random Data using 3 Nonlinear Functions
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 152 - Number 4 |
| Year of Publication: 2016 |
| Authors: Sharaf A. Alhomdy, Saleh N. Abdullah, Malek N. Algabri |
10.5120/ijca2016911776
|
Sharaf A. Alhomdy, Saleh N. Abdullah, Malek N. Algabri . Generating Random Data using 3 Nonlinear Functions. International Journal of Computer Applications. 152, 4 ( Oct 2016), 6-10. DOI=10.5120/ijca2016911776
Abstract
In recent years, security systems are built on increasingly strong cryptographic algorithms. Hence, most of the applications which require a high level of security system should include the random number generators (RNGs). Furthermore, most RNGs use nonlinear functions to generate secret quantities for protecting the information that need high level of the security for these applications. Unfortunately, the main deficiencies in the available RNGs are the short period of its repeat cycle length and also the predefined values determined by the static factors. Therefore, this paper describes a new technique to generate random data using 3 nonlinear functions which will extend the periodic cycle length of the repetition that enhances the system security.
References
- L'Ecuyer, P. & Simard, R. (2007), "Testu01: A C Library for Empirical Testing of Random Number Generators", ACM Trans. on Mathematical Software 33(4), 22- 27.
- Bruce Schneier (2010) “Applied Cryptography” 3rd Ed. John Wiley & Sons. (ASIA) Pvt. Ltd., Singapore.
- William Stallings (2009), “Cryptography and Network Security: Principles and Practice” 3rd Ed. India Reprint. Agrawal-M IETE-Technical-Review.
- Jerry Banks, etl. (2001), "Discrete-Event System Simulation", 3rd Ed. Pearson Education, Singapore.
- Borosh. S. & Niederreiter H., (1983) "Optimal Multipliers For Pseudo-Random Number Generation By The Linear Congruential Method",BIT 23, 65-74.
- Figiel, K.D., and Sule. D.R. (Mar. 1985), "New Lagged Product Test for Random Number Generators". Comput. Ind. Eng. Vol. 9, 287-296.
- P. L’Ecuyer, “Efficient and portable combined random number generators”, Communications of the ACM 31 June 1988 Volume 31 Number 6, USA.
- Saleh N. Abdullah & Sharaf A. Alhomdy (2015) "Dynamic Permutations", Global Journal of Computer Science and Technology (C), Volume 15 Issue 1 Version 1, USA.
- Douglasr Stinson (2002) “Cryptography: Theory and Practice”, 2nd Ed. Department of Combinatory and Optimization University of Waterloo, Waterloo.
- Behrouz Forouzan (2007), "Data Communications & Networking", 4th Ed., the McGraw-Hill Higher Education, Singapore.
- Deborah Russell and G. T. Gangemi Sr (2009) “Computer Security Basics”, O’Reilly& Associates, Inc., New York.
- Richard E. Smith. (2011) "Internet Cryptography", Addison-Wesley.
- Wright-MA (1999) "Network-Security". Nov., p.11-14 PY: 1999 RT: Journal-article.
- Dr. Saleh N. Abdullah & Dr. Sharaf A. Alhomdy, (2015), "Dynamic Random Number Generator based on User Seed(s)" International Journal of Computer Applications, Volume 118 – No. 3, May 2015, New York, USA.
Index Terms
Keywords