Volume : 9, Issue : 6, JUN 2023

NATIONAL CONFERENCE ON INNOVATIONS IN COMPUTING TECHNOLOGIES (NCICT'23)

RANDOMNESS MEASUREMENT FOR LIGHTWEIGHT BLOCK CIPHER

RAMYA K V, ARPITHA H S, CHAITANYA Y S, DEEKSHA R P, MEDHA J

Abstract

A lightweight block cipher is a type of encryption algorithm designed for use in resource constrained environments such as RFID tags, sensors, contactless smart cards, healthcare devices, and other IoT devices. These ciphers have a small code size and low computational requirements and a smaller amount of power to provide secure solutions for limited resources in a network. Lightweight block ciphers typically have a block size of 64 or 128 bits and a key length of 80 or 128 bits. They employ simple, efficient algorithms that can be implemented in hardware or software with minimal resources. Randomness is an important factor in the design of lightweight block ciphers as it provides the necessary confusion and diffusion properties required for secure encryption. Randomness can be achieved in lightweight block ciphers through various techniques such as key scheduling, round function design, and S-box design. This paper discusses different ways to measure randomness and tool associated to measure randomness for cipher.

Article : Download PDF

Cite This Article

-

Article No : 9

Number of Downloads : 1556

References

1. Nair Arun Mohandas; Adinath Swathi; Abhijith R.; Ajmal Nazar; Greeshma Sharath. 10-12 June (2020) 5th International Conference on Communication and Electronic Systems.

2. Abdullah N. A, N., Lot, N. H., Zawawi, A., & Rani, H. A. (2011, December). Analysis on lightweight block cipher, KTANTAN. In 2011 7th International Conference on Information Assurance and Security (IAS)

3. Yang Wu; Tao Wang; Jindong Li; (2015) Fifth International Conference on Instrumentation and Measurement, Computer, Communication and control(IMCC).

4. Marsaglia, G. (2008). The Marsaglia random number CDROM including the  diehard   battery    of tests of randomness. http://www.stat.fsu.ed/pub/diehard/

5. L'Ecuyer, P., & Simard, R. (2007). TestU01: AC library for empirical testing of random number generators. ACM Transactions on Mathematical Software (TOMS), 33(4), 1-40.

6. Bassham III, L, E., Rukhin , A. L., Soto. J., Nechvatal, J. R., Smid, M. E., Barker, E. B & Heckert, N. A. (2010). Sp 800-22 rev. 1a. a stastical test suite for random and pseudorandom number generators for cryptographic applications. National Institute of Standards & Technology.

7. Simion, E., and Burciu, P. (2019). A note on the correlations between NIST cryptographic statistical tests suite. University Polytechnics of Bucharest Scientific Bulletin- Series A-Applied Mathematics and Physics, 81(1): 209-218.

8. International Journal of cryptology Research (2020) ., The Strict Key test.

9. Bassham III et al., (2010)., High density key, Low density key, A.F. Ridzum, N.H. Zakaria and M. Daud International Journal of Cryptograph Research

10. Nair Arun Mohandas; Adinath Swathi; Abhijith R.; Ajmal Nazar; Greeshma Sharath. 10-12 June (2020) 5th International Conference on Communication and Electronic Systems.