PaperNo Access

An Improved Rao–Nam Cryptosystem Based on Fractional Order Hyperchaotic System and EDF–QC–LDPC

Jie Liu

School of Computer Science and Technology, Harbin Institute of Technology, Weihai, P. R. China

School of Rongcheng, Harbin University of Science and Technology, Rongcheng, P. R. China

Search for more papers by this author

Xiaojun Tong

http://orcid.org/0000-0002-1543-9433

School of Computer Science and Technology, Harbin Institute of Technology, Weihai, P. R. China

E-mail Address: tong_xiaojun@163.com

Corresponding author.

Search for more papers by this author

Zhu Wang

School of Information and Electrical Engineering, Harbin Institute of Technology, Weihai, P. R. China

Search for more papers by this author

Jing Ma

Science and Technology on Information, Assurance Laboratory, Beijing, P. R. China

Search for more papers by this author

, and

Longteng Yi

Communications Division, China Academy of Space Technology, Beijing, P. R. China

Search for more papers by this author

https://doi.org/10.1142/S0218127419501220Cited by:4 (Source: Crossref)

Abstract

A Rao–Nam cryptosystem based on error correction code is proposed to provide both security and reliability. Since its security is drastically constrained by the limited error syndromes, in this paper, an improved Rao–Nam cryptosystem based on fractional order hyperchaotic system and Extended Difference Family–Quasi-Cyclic–Low-Density Parity-Check (EDF–QC–LDPC) codes is proposed to improve the security. A four-dimensional fractional order hyperchaotic system is constructed and is used to generate an excellent pseudorandom sequence. By replacing error syndromes with the pseudorandom sequence and permuting the coded message dynamically, the security of the Rao–Nam cryptosystem is enhanced greatly. The ability of the improved Rao–Nam cryptosystem against known attacks is analyzed and the error correction performance with different parameters is simulated. The results show that the proposed cryptosystem has a significant advantage of resisting the chosen-plaintext attack. Moreover, the proposed cryptosystem retains high capacity of error correction.

Keywords:

References

Bagheri, K., Sadeghi, M. R., Eghlidos, T. & Panario, D. [2016] “ A secret key encryption scheme based on 1-level QC–LDPC lattices,” 2016 13th Int. Iranian Soc. Cryptology Conf. Information Security and Cryptology (ISCISC) (IEEE Press, Tehran), pp. 20–25. Google Scholar
Baldi, M., Bodrato, M. & Chiaraluce, F. [2008] “ A new analysis of the McEliece cryptosystem based on QC–LDPC codes,” Proc. 6th Int. Conf. Security and Cryptography for Networks, eds. Ostrovsky, R., De Prisco, R. & Visconti, I., Lecture Notes in Computer Science, Vol. 5229 (Springer Press, Berlin), pp. 246–262. Google Scholar
Barbero, Á. I. & Ytrehus, Ø. [2000] “ Modifications of the Rao–Nam cryptosystem,” Coding Theory, Cryptography and Related Areas, eds. Buchmann, J., Høholdt, T., Stichtenoth, H. & Tapia-Recillas, H. (Springer Press, Berlin), pp. 1–12. Google Scholar
Cang, S. J., Qi, G. Y. & Chen, Z. Q. [2010] “ A four-wing hyper-chaotic attractor and transient hyperchaotic generated from a new 4-D quadratic autonomous system,” Nonlin. Dyn. 59, 515–527. Web of Science, Google Scholar
Cheng, Y. C., Lu, E. H. & Wu, S. W. [1998] “ A modified version of the Rao–Nam algebraic-code encryption scheme,” Inform. Process. Lett. 68, 215–217. Web of Science, Google Scholar
Chung, S. Y., Richardson, T. J. & Urbanke, R. L. [2001] “ Analysis of sum-product decoding of low-density arity-check codes using a Gaussian approximation,” IEEE Trans. Inform. Th. 47, 657–670. Web of Science, Google Scholar
Fossorier, M. P. C., Mihaljevic, M. & Imai, H. [1999] “ Reduced complexity iterative decoding of low-density arity check codes based on belief propagation,” IEEE Trans. Commun. 47, 673–680. Web of Science, Google Scholar
Gallager, R. [1962] “ Low density parity check codes,” IRE Trans. Inform. Th. 8, 21–28. Web of Science, Google Scholar
Hooshmand, R., Eghlidos, T. & Aref, M. R. [2012] “ Improving the Rao–Nam secret key cryptosystem using regular EDF–QC–LDPC codes,” The ISC Int. J. Inform. Secur. 4, 3–12. Google Scholar
Ji, Y. D., Lai, L., Zhong, S. C. & Zhang, L. [2018] “ Bifurcation and chaos of a new discrete fractional-order logistic map,” Commun. Nonlin. Sci. Numer. Simul. 57, 352–358. Web of Science, Google Scholar
Mackay, D. J. C. & Neal, R. M. [1996] “ Near Shannon limit performance of low-density parity check codes,” Electron. Lett. 32, 1645–1646. Web of Science, Google Scholar
Oldham, K. B. & Spanier, J. [1974] The Fractional Calculus (Academic Press, NY). Google Scholar
Otmani, A., Tillich, J. P. & Dallot, L. [2010] “ Cryptanalysis of two McEliece cryptosystems based on quasi-cyclic codes,” Math. Comput. Sci. 3, 129–140. Google Scholar
Petráš, I. [2009] “ Hyperchaotic in the fractional-order Volta’s system: Modeling and simulation,” Nonlin. Dyn. 57, 157–170. Web of Science, Google Scholar
Podlubny, I. [1999] Fractional Differential Equations, 1st edition (Academic Press, NY). Google Scholar
Rao, T. R. N. [1984] “ Joint encryption and error correction schemes,” ACM Sigarch Comput. Architect. News 12, 240–241. Google Scholar
Rao, T. R. N. & Nam, K. H. [1987] “ Private-key algebraic-coded cryptosystems,” Adv. Cryptology-CRYPTO’86, ed. Odlyzko, A. M., Vol. 263 (Springer Press, Berlin), pp. 35–48. Google Scholar
Rao, T. R. N. & Nam, K. H. [1989] “ Private-key algebraic-code encryptions,” IEEE Trans. Inform. Th. 35, 829–833. Web of Science, Google Scholar
Struik, R. & Tilburg, J. [1988] “ The Rao–Nam scheme is insecure against a chosen-plaintext attack,” Advances in Cryptology-CRYPTO’87, ed. Pomerance, C., Lecture Notes in Computer Science, Vol. 293 (Springer Press, Berlin), pp. 445–457. Google Scholar
Stuart, C. M. & Pattathil, D. P. [2015] “ A novel low-complexity scheme for improving security of NLFG-based symmetric key cryptosystem using secure concatenated RS-QCLDPC code,” Secur. Commun. Netw. 8, 2888–2900. Web of Science, Google Scholar
Stuart, C. M., Spandana, K., Dhanaraj, K. J. & Pattathil, D. P. [2016] “ Design and implementation of hardware-efficient modified Rao–Nam scheme with high security for wireless sensor networks,” J. Inform. Secur. Appl. 29, 65–79. Web of Science, Google Scholar
Tanner, R. M., Sridhara, D., Sridharan, A. & Fuja, T. E. [2004] “ LDPC block and convolutional codes based on circulant matrices,” IEEE Trans. Inform. Th. 50, 2966–2984. Web of Science, Google Scholar
Tilburg, J. V. [1994] “Security-analysis of a class of cryptosystems based on linear error-correcting codes,” PhD thesis, Technische Universiteit Eindhoven, Eindhoven, Holland. Google Scholar
Wang, L. [2009] “ 3-scroll and 4-scroll chaotic attractors generated from a new 3-D quadratic autonomous system,” Nonlin. Dyn. 56, 453–462. Web of Science, Google Scholar
Xia, T. & Xia, B. [2005] “ Quasi-cyclic codes from extended difference families,” Wireless Commun. Netw. Conf. 2, 1036–1040. Google Scholar