CFP last date
20 December 2024
Call for Paper
January Edition
IJCA solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 20 December 2024

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

A Novel Unpredictable Temporal based Pseudo Random Number Generator

by Aqeel Khalique, Auqib Hamid Lone, Syed Shahabuddin Ashraf
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 117 - Number 13
Year of Publication: 2015
Authors: Aqeel Khalique, Auqib Hamid Lone, Syed Shahabuddin Ashraf
10.5120/20615-3301

Aqeel Khalique, Auqib Hamid Lone, Syed Shahabuddin Ashraf . A Novel Unpredictable Temporal based Pseudo Random Number Generator. International Journal of Computer Applications. 117, 13 ( May 2015), 23-28. DOI=10.5120/20615-3301

@article{ 10.5120/20615-3301,
author = { Aqeel Khalique, Auqib Hamid Lone, Syed Shahabuddin Ashraf },
title = { A Novel Unpredictable Temporal based Pseudo Random Number Generator },
journal = { International Journal of Computer Applications },
issue_date = { May 2015 },
volume = { 117 },
number = { 13 },
month = { May },
year = { 2015 },
issn = { 0975-8887 },
pages = { 23-28 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume117/number13/20615-3301/ },
doi = { 10.5120/20615-3301 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:59:18.890065+05:30
%A Aqeel Khalique
%A Auqib Hamid Lone
%A Syed Shahabuddin Ashraf
%T A Novel Unpredictable Temporal based Pseudo Random Number Generator
%J International Journal of Computer Applications
%@ 0975-8887
%V 117
%N 13
%P 23-28
%D 2015
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Random numbers are sequences of integers which show absolutely no relation to each other anywhere in the sequence. Pseudo random numbers (PRNs) are random numbers which can be generated deterministically. Pseudo random numbers are widely used in cryptographic protocols to provide secrecy. A wide variety of pseudo random number generators (PRNGs) were proposed earlier which exhibit characteristics of PRNG and generate pseudo random numbers. In this paper, we propose a temporal based algorithm to generate pseudo random numbers. Our algorithm utilizes dynamic system clock and product of two large prime numbers generated randomly. Using dynamic system clock, we ensure that the seed is obtained from entropy source of some physical phenomenon and product of large prime numbers generated randomly ensure randomness of generated numbers. Our algorithm is easy to implement on any computing device and can be used for generating sequence of pseudo random numbers for desired purpose.

References
  1. Schneier, B. 1996. Applied Cryptography. John Wiley & Sons. 2nd Edition.
  2. Ramaswamy, R. 1989. Application of key generation and distribution algorithm for secure communication in open system interconnection architecture. In Proceedings of International Carnahan Conference on Security Technology.
  3. Rinne, T. , Ylonen, T. , Kivinen, T. and Sami, M. S. 2002. SSH Authentication Protocol. Network Working Group, Internet Draft. IETF.
  4. Rukhin, A. , Soto, J. , Nechvatal, J. , Smid, M. , Barker, E. , Leigh, S. , Levenson, M. , Vangel, M. , Banks, D. , Heckert, A. , Dray, J. and Vo S. 2010. A statistical test suite for random and pseudorandom number generators for cryptographic applications. NIST Special Publication 800-22.
  5. Fair, R. C. , Mortenson, R. L. and Coulthart, K. B. 1984. An LSI Random Number Generator (RNG). Advances in Cryptography: Proceedings of Crypto 84. Vol. 196.
  6. Stojanovski, T. , Pil, J. and Kocarev L. 2001. Chaos-based random number generators. Part II: practical realization. Circuits and Systems I: Fundamental Theory and Applications, IEEE Transactions. Vol. 48.
  7. Petrie, C. S. and Connelly J. 2000. A noise-based IC random number generator for applications in cryptography. IEEE Transactions on Circuits and Systems. Vol. 47.
  8. Knuth, D. 1981. The Art of Computer Programming. Addison-Wesley.
  9. Wolfram, S. 1986. Random sequence generation by cellular automata. Advances in Applied Mathematics. Vol. 7.
  10. Martin, P. 2002. An analysis of random number generators for a hardware implementation of genetic programming using FPGAs and Handel-C. Proceedings of the Genetic and Evolutionary Computation Conference.
  11. Watkins, R. K. , Isaacs, J. C. and Foo S. Y. 2001. Evolvable random number generators: A schemata-based approach. Genetic and Evolutionary Computation Conference Late Breaking Papers.
  12. Blum, L. , Blum, M. and Shub M. 1986. A simple unpredictable pseudo-random number generator. SIAM Journal on computing. Vol. 15.
  13. Lehmer, D. H. 1949. Mathematical methods in large-scale computing units. 2nd Symposium on Large-Scale Digital Calculating Machinery. pp. 141-146.
  14. Klein, A. 2013. Stream Ciphers. Chapter 2: Linear Feedback Shift Registers.
  15. Aviv Sinai, 2011. Pseudo Random Number Generators in Programming Languages: http://portal. idc. ac. il/en/schools/cs/research/documents/sinai_2011. pdf
Index Terms

Computer Science
Information Sciences

Keywords

Random Number Generation Pseudo Random Numbers Cryptography.

Powered by PhDFocusTM