International Journal of Computer Network and Information Security (IJCNIS)
IJCNIS Vol. 10, No. 2, 8 Feb. 2018
Cover page and Table of Contents: PDF (size: 755KB)
Acoustic Lightweight Pseudo Random Number Generator based on Cryptographically Secure LFSR
Full Text (PDF, 755KB), PP.38-45
Views: 0 Downloads: 0
Author(s)
Index Terms
PRNG, Acoustic, Lightweight, LFSR, Cryptographically secure
Abstract
In this paper, we propose a secure, lightweight acoustic pseudo-random number generator (SLA-LFSR-PRNG) that consumes less memory, CPU capacity and adopts the multi-thread parallelization to generate huge random numbers per second by taking the advantages of multi-core CPU and massively parallel architecture of GPU. The generator is based on cryptographically secure Linear Feedback Shift Register(LFSR) and extracts the entropy from sound sources. The major attraction of proposed Pseudo Random Number Generator(PRNG) is its immunity to major attacks on pseudo-random number generators. The paper presents test results of proposed PRNG subjected to NIST SP 800-22 statistical test suite and also shows the performance comparison of proposed generator on different systems.
Cite This Paper
Mohammed Abdul Samad AL-khatib, Auqib Hamid Lone, "Acoustic Lightweight Pseudo Random Number Generator based on Cryptographically Secure LFSR", International Journal of Computer Network and Information Security(IJCNIS), Vol.10, No.2, pp.38-45, 2018. DOI:10.5815/ijcnis.2018.02.05
Reference
[1]"Statistics/Numerical Methods/Random Number Generation - Wikibooks, open books for an open world", En.wikibooks.org, 2017. [Online]. Available: https://en.wikibooks.org/wiki/Statistics/Numerical_Methods/Random_Number_Generation. [Accessed: 27- Apr- 2017].
[2]R. Motwani and P. Raghavan, Randomized algorithms, 1st ed. Cambridge: Cambridge University Press, 2007, pp. 128-132.
[3]P. Hellekalek, "Good random number generators are (not so) easy to find", Mathematics and Computers in Simulation, vol. 46, no. 5-6, pp. 485-505, 1998.
[4]C. Shannon, "A Mathematical Theory of Communication", Bell System Technical Journal, vol. 27, no. 3, pp. 379-423, 1948.
[5]J. Cheng, M. Grossman and T. McKercher, Professional CUDA? C programming, 1st ed. Indianapolis, Indiana: Wrox, a Wiley brand, 2014, pp. 2-14.
[6]W. Schindler, "Random Number Generators for Cryptographic Applications", Cryptographic Engineering, pp. 5-23, 2009.
[7]A. Klein, "Linear Feedback Shift Registers", Stream Ciphers, pp. 17-58, 2013.
[8]B. Schneier, Applied cryptography, 2nd ed. New York [etc.]: Wiley-India, 2007, pp. 372-379.
[9]J. Parker, "The period of the Fibonacci random number generator", Discrete Applied Mathematics, vol. 20, no. 2, pp. 145-164, 1988.
[10]R. Ziff, "Four-tap shift-register-sequence random-number generators", Computers in Physics, vol. 12, no. 4, p. 385, 1998.
[11]A. Kashmar and E. Ismail, "Pseudorandom number generator using Rabbit cipher", Applied Mathematical Sciences, vol. 9, no. 88, pp. 4399-4412, 2015.
[12]G. Bertoni, J. Daemen, M. Peeters and G. Van Assche, "Sponge-Based Pseudo-Random Number Generators", Cryptographic Hardware and Embedded Systems, CHES 2010, vol. 6225, pp. 33-47, 2010.
[13]0S. Neves and F. Araujo, "Fast and Small Nonlinear Pseudorandom Number Generators for Computer Simulation", Parallel Processing and Applied Mathematics, vol. 7203, pp. 92-101, 2012.
[14]A. Khalique, A. Hamid Lone and S. Shahabuddin Ashraf, "A Novel Unpredictable Temporal based Pseudo Random Number Generator", International Journal of Computer Applications, vol. 117, no. 13, pp. 23-28, 2015.
[15]L. Min, L. Zhang and Y. Zhang, "A novel chaotic system and design of pseudorandom number generator", 2013 Fourth International Conference on Intelligent Control and Information Processing (ICICIP), 2013.
[16]Shuangshuang Han, Lequan and Ting Liu, "Marotto's theorem-based chaotic pseudo-random number generator and performance analysis", 2011 International Conference on Multimedia Technology, 2011.
[17]B. Kang, D. Lee and C. Hong, "High-Performance Pseudorandom Number Generator Using Two-Dimensional Cellular Automata", 4th IEEE International Symposium on Electronic Design, Test and Applications (delta 2008), 2008.
[18] P. Hortensius, R. McLeod, W. Pries, D. Miller and H. Card, "Cellular automata-based pseudorandom number generators for built-in self-test", IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 8, no. 8, pp. 842-859, 1989.
[19]J. Kelsey, B. Schneier, D. Wagner and C. Hall, "Cryptanalytic Attacks on Pseudorandom Number Generators", Fast Software Encryption, pp. 168-188, 1998.
[20]K. Claessen and M. H. Pa?ka, "Splittable pseudorandom number generators using cryptographic hashing", ACM SIGPLAN Notices, vol. 48, no. 12, pp. 47-58, 2013.
[21]Hongwei Wu, Xiangnan Liu and Weibin Tang, "A fast GPU-based implementation for MD5 hash reverse", 2011 IEEE International Conference on Anti-Counterfeiting, Security and Identification, 2011.
[22]M. Krishnaswamy and G. Kumar, "GPU based parallel hashing verification for biometric smart cards and aadhaar IDs", 2014 International Conference on Electronics and Communication Systems (ICECS), 2014.
[23]P. Peach, "Bias in Pseudo-Random Numbers", Journal of the American Statistical Association, vol. 56, no. 296, pp. 610-618, 1961.
[24]A. Rukhin, J. Soto, J. Nechvatal, et al. "Statistical test suite for random and pseudorandom number generators for cryptographic applications", NIST special publication, 2010.