On the Generation of Random Numbers for Symmetric Cryptography Utilizing Astronomical Data

Abstract:

In this paper, a novel method for obtaining the random numbers utilizing astronomical data is proposed. The method uses two different algorithms for generation of random numbers sequence. Astronomical data collected from the scientific study of the universe, especially of the relative motions, relative positions of astronomical objects are utilized in our algorithms. The first algorithm uses a particular astronomical object in a fixed position for the random number generation. The random sequence is obtained from the relative positions of other astronomical objects with reference to the selected object. The second algorithm selects any diverse astronomical object as a reference in a varying mode for computation of the relative positions of different objects with that reference to generate the random number stream. Both algorithms use mathematical equations for computing the next jump or hop to the other astronomical object. The generated random numbers obtained from the two algorithms are tested with a standard statistical test suite including, frequency test, run test, random binary matrix rank test, complexity test, universal test and entropy test. The results obtained from the statistical tests of the two algorithms are compared with the other publicly available random number generation techniques, like, linear congruential and modular exponentiation. The preliminary results show that the algorithms perform well. The random numbers generated by our method has sufficient period and unpredictability that makes them suitable for consideration as encryption keys in symmetric cryptography.

• Periodical: Advanced Materials Research (Volume 367)
• Pages: 185-190
• DOI: https://doi.org/10.4028/www.scientific.net/AMR.367.185
• Online since: October 2011
• Authors: P.M. Rubesh Anand, Vidhyacharan Bhaskar, Gaurav Bajpai, Godwin Norense Osarumwense Asemota
• Keywords: Astronomical Data, Data Security, Encryption, Random Numbers, Symmetric Cryptography

References

[1] R. Blom, An Optimal Class of Symmetric Key Generation System, Advances in Cryptology - Eurocrypt'84, LNCS 209 (1985) 335-338.

[2] National Institute of Standards and Technology, FIPS 140-1, Security Requirements for Cryptographic Modules, Federal Information Processing Standards Publication 140-1, National Technical Information Service, Springfield, VA, (1994).

DOI: 10.6028/nist.fips.140-1

[3] L. Blum, M. Blum and M. Shub, A simple unpredictable pseudorandom number generator, SIAM Journal on Computing, 15(2) (1986) 364-383.

DOI: 10.1137/0215025

[4] Whitfield Diffie and Martin E. Hellman, New directions in cryptography, IEEE Transactions on Information Theory, 22(6) (1976) 644-654.

DOI: 10.1109/tit.1976.1055638

[5] R. Rivest, A. Shamir, L. Adleman, A Method for Obtaining Digital Signatures and Public-Key Cryptosystems, Communications of the ACM, 21(2) (1978) 120–126.

DOI: 10.1145/359340.359342

[6] Bruce Schneier, Applied Cryptography Protocols, Algorithms, and Source Code in C, Second Edition, John Wiley & Sons, 1996, pp.369-388.

[7] Information on: http: /cas. sdss. org/dr7/en/sdss/data/data. asp.

[8] Gordon Moyer, The Origin of the Julian Day System, Sky and Telescope, 61 (1981) 311-313.

[9] National Institute of Standards and Technology, A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic applications, Special Publication 800-22 Revision 1a, April (2010).