Omer AYDIN, Umut Can ÇABUK, Gökhan DALKILIÇ

A random number generator for lightweight authentication protocols: xorshiftR+

This paper presents the results of research that aims to nd a suitable, reliable, and lightweight pseudorandom number generator for constrained devices used in the Internet of things. Within the study, three reduced versions of the xorshift+ generator are built. They are tested using the TestU01 suite as well as the NIST suite to measure their ability to produce randomness and performance values along with some other existing generators. The best of our reduced variations according to our tests, called the xorshiftR+, demonstrated great suitability for lightweight devices considering its randomness, performance, and resource usage.

PDF

___

[1] Hellekalek P. Good random number generators are (not so) easy to nd. Math Comput Simulat 1998; 46: 485-505.
[2] Ozcanhan MH, Dalklc G. Mersenne twister-based RFID authentication protocol. Turk J Elec Eng & Comp Sci 2015; 23: 231-254.
[3] Eastlake D 3rd, Crocker S, Schiller J. Randomness Recommendations for Security. RFC 1750. Fremont, CA, USA: IETF, 1994.
[4] Marsaglia G. The DIEHARD Battery of Tests of Randomness. Technical Report. Tallahassee, FL, USA: Florida State University, 1995.
[5] L'Ecuyer P, Simard R. TestU01: A C library for empirical testing of random number generators. ACM T Math Software 2007; 33: 22.
[6] Bassham LE 3rd. A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications. NIST Special Publication 800-22rev1a. Gaithersburg, MD, USA: NIST, 2010.
[7] Barker E, Kelsey J. Recommendation for Random Bit Generator (RBG) Constructions. NIST Special Publication 800-90C Second Draft. Gaithersburg, MD, USA: NIST, 2016.
[8] Barker E, Kelsey J. Recommendation for Random Number Generation Using Deterministic Random Bit Generators. NIST Special Publication 800-90A. Gaithersburg, MD, USA: NIST, 2012.
[9] Turan MS, Barker E, Kelsey J, McKay KA, Baish ML, Boyle M. Recommendation for the Entropy Sources Used for Random Bit Generation. NIST Special Publication 800-90B Second Draft. Gaithersburg, MD, USA: NIST, 2016.
[10] Marsaglia G. Xorshift RNGs. J Stat Softw 2003; 8: 1-6.
[11] O'Neill ME. PCG: A family of simple fast space-efficient statistically good algorithms for random number generation. Available online at http://www.pcg-random.org/pdf/toms-oneill-pcg-family-v1.02.pdf.
[12] Vigna S. An experimental exploration of Marsaglia's xorshift generators, scrambled. ArXiv e-print 2014. Available online at https://arxiv.org/abs/1402.6246.
[13] Matsumoto M, Nishimura T. Mersenne twister: a 623-dimensionally equi-distributed uniform pseudo-random number generator. ACM T Model Comput S 1998; 8: 3-30.
[14] Vigna S. Further scramblings of Marsaglia's xorshift generators, J Comput Appl Math 2016; 315: 175-181.
[15] Singh KP, Kumar D. Performance evaluation of low power MIPS crypto processor based on cryptography algorithms. International Journal of Engineering Research and Applications 2012; 2: 1625-1634.
[16] Brent RP. Some long-period random number generators using shifts and xors. ANZIAM J 2007; 48: 188-201.
[17] Thakur J, Kumar N. DES, AES and Blow sh: Symmetric key cryptography algorithms simulation based perfor- mance analysis. International Journal of Emerging Technology and Advanced Engineering 2011; 1: 2250-2459.
[18] L'Ecuyer P, Simard R. TestU01: A Software Library in ANSI C for Empirical Testing of Random Number Generators User's Guide Document. Montreal, Canada: University of Montreal, 2014.