A Comparison of the Randomness Analysis of the Modified Rectangle Block Cipher and Original algorithm

Authors

  • Shatha A. Baker Northern Technical University, Iraq
  • Ahmed S. Nori University of Mosul

DOI:

https://doi.org/10.56286/ntujps.v1i2.185

Keywords:

Security, RECTANGLE algorithm, Randomness Analysis, Data Categories, NIST

Abstract

In recent years, different encryption lightweight algorithms have been suggested to protect the security of data transferred across the IoT network. The symmetric key ciphers play a significant role in the security of devices, in particular block ciphers. the RECTANGLE algorithm amongst the current lightweight algorithms. Rectangle algorithm does have good encryption efficacy but the characteristics of confusion and diffusion that a cipher needed are lacking from this algorithm. Therefore, by improving the algorithm confusion and diffusion properties, we expanded Rectangle utilizing a 3D cipher and modified the key scheduling algorithm. To assess if these two algorithms are random or not, randomness analysis was done by using the NIST Statistical Test Suite. To create 100 samples for each algorithm, nine distinct data categories were used. These algorithms created ciphertext blocks, which were then concatenated to form a binary sequence. NIST tests carried out under 1% significance level. According to the results of the comparison study, the proposed algorithm's randomness analysis results are gave 27.48% better results than the original algorithm.

Downloads

Published

2022-05-31

How to Cite

A Comparison of the Randomness Analysis of the Modified Rectangle Block Cipher and Original algorithm. (2022). NTU Journal of Pure Sciences, 1(2), 10-21. https://doi.org/10.56286/ntujps.v1i2.185