NMC: A Fast and Secure ARX Cipher

Authors

  • Noureldien A. Noureldien University of Science and Technology, Faculty of Computer Science and Information Technology, Omdurman, Sudan
  • Mustafa B. Hassan University of Science and Technology, Faculty of Computer Science and Information Technology, Omdurman, Sudan

DOI:

https://doi.org/10.14738/tecs.116.15857

Keywords:

Symmetric Encryption, Stream Cipher, Keystream, Randomness, Keystream Period, Cipher Performance, Throughput

Abstract

Fastening complex computing tasks and reducing latency have become essential in areas such as cryptography, robotics, natural-language processing, and video streaming. This is because even a few milliseconds can have a significant impact on the operation, performance, and computational cycle consumption of the algorithm. This paper introduces a new ARX cipher design called NMC.  NMC is a fast and secure stream cipher and it generates keystream bytes solely from secret key bits and plaintext message length. NMC has high randomness, long keystream period, and one time pad (OTP) keystream production. Experimental testing confirmed the randomness of the keystreams and showed that NMC has marginally better speed performance than RC4 for short messages but is slightly slower for messages of average length and slightly large messages. NMC's synchronization mode showed that the keystream period is long and NMC achieved OTP keystream production. The results indicate that NMC is a competitive and promising cipher algorithm.

References

A. Klein, Introduction to stream ciphers, Stream Ciphers, Springer, (2013), pp. 1-13.

S. M. Bellovin, Frank Miller: Inventor of the One Time Pad, Cryptologia, vol. 35, issue 3, (2011), pp. 203-222.

C. E. Shannon, Communication theory of secrecy systems, Bell system technical journal, vol. 28, issue 4, (1949), pp. 656-715.

C. Fontaine, Synchronous stream cipher. In: Encyclopedia of Cryptography and Security. Beilin: Springer, 2005. 1274–1275

W. Millan, E. Dawson, On the security of self-synchronous ciphers. In: Proceedings of Australasian Conference on Information Security and Privacy, 1997. 159–170

C. Manifavas, G. Hatzivasilis, K. Fysarakis, I. Papaefstathiou, A survey of lightweight stream ciphers for embedded systems, Security and Communication Networks, 2010.

Lin JIAO, Yonglin HAO & Dengguo FENG, Stream cipher designs: a review, SCIENCE CHINA, Information Sciences, March 2020, Vol. 63 131101:1–131101:25

Kuai Yu, et.al. "Efficient Software Implementation of ZUC Stream Cipher", Proceedings of the 2nd International Conference on Vision, Image and Signal ProcessingAugust 2018, Article No.: 52, pp 1–6https://doi.org/10.1145/3271553.3271580

A. Makalesi, et al., "A New pseudo random number generator design with LFSR based 32-bit floating point with high-speed FPGA," Int. J. Adv. Eng. Pure Sci., 32(3), 219-228 (2020)

B. Qu, D. Gu, Z. Guo, J. Liu, "Differential power analysis of stream ciphers with LFSRs," Computers & Mathematics with Applications, 65(9), 1291-1299 (2013).

G. Paul, S. Maitra, RC4 stream cipher and its variants, Discrete Mathematics and Its Applications, CRC press, (2011).

D. J. Bernstein. The Salsa20 family of stream ciphers, CR.YP.TO, (2007), available online: http://cr.yp.to/snuffle/salsafamily-20071225.pdf, last visit: 01.07.2015.

B. Zhang, Z. Shi, C. Xu, Y. Yao, Z. Li, Sablier v1, CAESAR competition, (2014), available online: http://competitions.cr.yp.to/round1/sablierv1.pdf, last visit: 01.07.2015.

Beaulieu, Ray; Shors, Douglas; Smith, Jason; Treatman-Clark, Stefan; Weeks, Bryan; Wingers, Louis. "The SIMON and SPECK Families of Lightweight Block Ciphers", 2013.

M. Rosen-Zvi, E. K. Ido Kanter, W. Kinzel, Mutual learning in a tree parity machine and its application to cryptography, Physical Review E, vol. 66, issue 6, (2002), pp. 066135-066148.

T. Chen, L. Ge, X. Wang, C. Jiamei, TinyStream: A Lightweight and Novel Stream Cipher Scheme for Wireless Sensor Networks, CIS 2010, (2010), pp. 528- 532.

M. Hell, T. Johansson, W. Meier, Grain a Stream Cipher for Constrained Environments, International Journal of Wireless and Mobile Computing, vol. 2, No 1/2007, 2007, pp. 86-93.

Rivest R. The RC4 encryption algorithm. Rsa Data Secur Inc Doc No, 1992, 20: 86–96

ETSI/SAGE. Specification of the 3GPP confidentiality and integrity algorithms UEA2&UIA2. Document 2: SNOW 3G Specification, Version 1.1, 2006. http://www.gsmworld.com/using/algorithms/docs/etsi sage 06 09 06.pdf

Feng X T. ZUC algorithm: 3GPP LTE international encryption standard. China Inform Secur, 2011, 19: 45–

Bluetooth. Specification of the Bluetooth system. 2005. https://www.bluetooth.com/specifications/adoptedspecifications

Samuel Greengard, Better Algorithms through Faster Math, June 2023 | Vol. 66 | No. 6 | Communications of the ACM.

Kumar, I. Cryptology. Laguna Hills, CA: Aegean Park Press, 1997

Nagendar Yerukala, V Kamakshi Prasad, and Allam Apparao, Performances and Statistical Analysis of Stream Ciphers in GSM Communications, Journal of Communications Software and Systems, Vol. 16, No. 1. March 2020.

A. Rukhin, J. Soto, J. Nechvatal, M. Smid, E. Barker, S. Leigh, M. Levenson, M. Vangel, D. Banks, A. Heckert, J. Dray, and S. A statistical test suite for random and pseudorandom number generators for cryptographic applications, National Institute of Standards and Technology (NIST), special publication 800-22.

G. Marsaglia. (1995), DIEHARD Statistical Tests. http://stat.fsu.edu/geo/diehard.html

NIST. (2001), Federal Information Processing Standards (FIPS) Publications: FIPS 140-2, Security Requirements for Cryptographic Modules, http://csrc.nist.gov/publications/PubsFIPS.html#140-2.

Downloads

Published

2023-11-28

How to Cite

Noureldien, N. A., & Hassan, M. B. (2023). NMC: A Fast and Secure ARX Cipher. Transactions on Engineering and Computing Sciences, 11(6), 45–59. https://doi.org/10.14738/tecs.116.15857