An exploratory analysis of the evolution and trends of code-based cryptography

Redhu, Ritu; Narwal, Ekta

doi:10.47974/JDMSC-2236

Open Access Research Article

An exploratory analysis of the evolution and trends of code-based cryptography

^*Ritu RedhuCorresponding authorritu.rs.maths@mdurohtak.ac.inDepartment of Mathematics M. D. UniversityRohtak, Haryana, 124001, IndiaView full profile → , Ekta Narwalektanarwal.math@mdurohtak.ac.inDepartment of Mathematics M. D. UniversityRohtak, Haryana, 124001, IndiaView full profile →

* Corresponding author · click or hover a name for details

pp. 959–972Vol. 28Issue 3April 2025DOI: 10.47974/JDMSC-2236 Crossmark XML

Received:: 12 Mar 2024
Published Online:: 18 Apr 2025
Article type:: Research Article
Language:: EN
Article no.:: JDMSC-2236
Pages:: 959–972

Abstract

Code-based cryptography has emerged as a promising paradigm in cryptographic research, offering robust security foundations against quantum computing threats. This bibliometric analysis provides a comprehensive overview of code-based cryptography scholarly contributions and trends using the Scopus’s extensive database. The relevant publications, including articles and conference papers are extracted to understand the evolution of code-based cryptography research over time. To map the intellectual structure of this field, the bibliometric indicators such as the performance of a 45-year span of publication timelines, prominent journals, authors, research institutions, nations, and disciplines are used. This bibliometric analysis provides insight into pivotal advancement, key contributors, and emerging areas of code-based cryptography. In addition to contributing to the existing body of knowledge, this comprehensive bibliometric examination of code-based cryptography serves as an invaluable resource to researchers seeking understand the dynamics and trajectory of this crucial cryptographic field in contemporary research.

Keywords

Bibliometric analysis Code-based cryptography Error-correcting codes McEliece Quantum computing

Subject Classifications

06F25

References

[1] Nicolas Aragon, Philippe Gaborit, Ayoub Hauteville, Olivier Ruatta, and Gilles Zémor, “Low Rank Parity Check Codes: New Decoding Algorithms and Applications to Cryptography,” IEEE Trans. Inf. Theory, vol. 65, no. 12, pp. 7697–7717 (2019), doi: 10.1109/TIT.2019.2933535.
[2] Marco Baldi, Giacomo Cancellieri, Franco Chiaraluce, Edoardo Persichetti, and Paolo Santini, “Using Non-Binary LDPC and MDPC Codes in the McEliece Cryptosystem,” in Proc. 2019 AEIT Int. Annu. Conf. (AEIT), Florence, Italy, pp. 1–6 (2019), doi: 10.23919/AEIT.2019.8893339.
[3] Marco Baldi, Franco Chiaraluce, Joachim Rosenthal, Paolo Santini, and Davide Schipani, “Security of generalised Reed–Solomon code-based cryptosystems,” IET Inf. Secur., vol. 13, no. 4, pp. 404–410 (2019), doi: 10.1049/iet-ifs.2018.5207.
[4] Alessandro Barenghi, Walter Fornaciari, Andrea Galimberti, Giuseppe Pelosi, and Davide Zoni, “Evaluating the Trade-offs in the Hardware Design of the LEDAcrypt Encryption Functions,” in Proc. 2019 26th IEEE Int. Conf. Electron., Circuits Syst. (ICECS), Genoa, Italy, pp. 739–742 (2019), doi: 10.1109/ICECS46596.2019.8964882.
[5] Jean-François Biasse, Giacomo Micheli, Edoardo Persichetti, and Paolo Santini, “LESS is More: Code Based Signatures Without Syndromes,” in Lecture Notes in Computer Science, vol. 12174, Cham: Springer, pp. 45–65 (2020), doi: 10.1007/978-3-030-51938-4_3.
[6] Irina E. Bocharova, Thomas Johansson, and Boris D. Kudryashov, “Improved iterative decoding of QC-MDPC codes in the McEliece public key cryptosystem,” in Proc. 2019 IEEE Int. Symp. Inf. Theory (ISIT), Paris, France, pp. 1882–1886 (2019), doi: 10.1109/ISIT.2019.8849839.
[7] P.-L. Cayrel, S. M. El Yousfi Alaoui, G. Hoffmann, M. Meziani, and R. Niebuhr, “Recent progress in code-based cryptography,” in Information Security and Assurance. ISA 2011, T. Kim, H. Adeli, R. J. Robles, and M. Balitanas, Eds., Communications in Computer and Information Science, vol. 200. Berlin, Germany: Springer, pp. 21–32 (2011). doi: 10.1007/978-3-642-23141-4_3.
[8] P.-L. Cayrel, G. Hoffmann, and E. Persichetti, “Efficient implementation of a CCA2-secure variant of McEliece using generalized Srivastava codes,” in Lecture Notes in Computer Science, vol. 7237, Berlin, Germany: Springer, pp. 138–155 (2012). doi: 10.1007/978-3-642-30057-8_10.
[9] A. Couvreur, M. Lequesne, and J.-P. Tillich, “Recovering short secret keys of RLCE in polynomial time,” in Lecture Notes in Computer Science, vol. 11505, Berlin, Germany: Springer, pp. 133–152 (2019). doi: 10.1007/978-3-030-25510-7_7.
[10] P. Gaborit, A. Otmani, and H. T. Kalachi, “Polynomial-time key recovery attack on the Faure-Loidreau scheme based on Gabidulin codes,” Designs, Codes and Cryptography, vol. 86, no. 7, pp. 1391–1403 (Jul. 2018). doi: 10.1007/s10623-017-0402-0.
[11] K. Khathuria, J. Rosenthal, and V. Weger, “Encryption scheme based on expanded Reed-Solomon codes,” Advances in Mathematics of Communications, vol. 15, no. 2, pp. 207–218 (May 2021). doi: 10.3934/amc.2020053.
[12] R. Khurana and E. Narwal, “Analysis of code-based digital signature schemes,” International Journal of Electrical and Computer Engineering (IJECE), vol. 13, no. 5, pp. 5534–5541 (Oct. 2023). doi: 10.11591/ijece.v13i5.pp5534-5541.
[13] M. Kumar, “Post-quantum cryptography algorithm’s standardization and performance analysis,” Array, vol. 15, p. 100242 (Dec. 2022). doi: 10.1016/j.array.2022.100242.
[14] S. Kumari, M. Singh, R. Singh, and H. Tewari, “A post-quantum lattice based lightweight authentication and code-based hybrid encryption scheme for IoT devices,” Computer Networks, vol. 217, p. 109327 (Apr. 2022). doi: 10.1016/j.comnet.2022.109327.
[15] T. S. C. Lau and C. H. Tan, “A new encryption scheme based on rank metric codes,” in Lecture Notes in Computer Science, vol. 10946, pp. 750–758 (2018). doi: 10.1007/978-3-319-93638-3_43.
[16] T. S. C. Lau and C. H. Tan, “A new Gabidulin-like code and its application in cryptography,” in Lecture Notes in Computer Science, vol. 11445, pp. 269–287 (2019). doi: 10.1007/978-3-030-16458-4_16.
[17] A. Leevik, V. Beliaev, B. Stasenko, V. Davydov, and S. Bezzateev, “Review and analysis of the classical and post-quantum ring signature algorithms,” in Proc. 2020 12th Int. Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT), pp. 105–112 (2020). doi: 10.1109/ICUMT51630.2020.9222244.
[18] E. Narwal, Ritu, Niram, and Deepika, “ERN cryptosystem for the security of textual data based on modified classical encryption techniques,” Indian Journal of Science and Technology, vol. 16, no. 4, pp. 292–298 (Jan. 2023). doi: 10.17485/IJST/v16i4.2009.
[19] P. Perez-Pacheco and P. Caballero-Gil, “McEliece cryptosystem: reducing the key size with QC-LDPC codes,” in Proc. 2023 19th Int. Conf. on the Design of Reliable Communication Networks (DRCN), pp. 1–6 (2023). doi: 10.1109/DRCN57075.2023.10108339.
[20] I. Putu Agus Eka Pratama and I. Gusti Ngurah Agung Krisna Adhitya, “Post quantum cryptography: comparison between RSA and McEliece,” in Proc. 2022 Int. Conf. on ICT for Smart Society (ICISS), pp. 1–5 (2022). doi: 10.1109/ICISS55894.2022.9915232.
[21] R. Redhu and E. Narwal, “Polar code-based cryptosystem: comparative study and analysis of efficiency,” Indonesian Journal of Electrical Engineering and Computer Science, vol. 32, no. 2, pp. 804–810 (May 2023). doi: 10.11591/ijeecs.v32.i2.pp804-810.
[22] Niram Ritu, E. Narwal, and S. Gill, “A novel cipher technique using substitution and transposition methods,” in Rising Threats in Expert Applications and Solutions, Lecture Notes in Networks and Systems, vol. 434, pp. 123–129 (2022). doi: 10.1007/978-981-19-1122-4_14.
[23] M. Schöffel, J. Feldmann, and N. Wehn, “Code-based cryptography in IoT: A HW/SW co-design of HQC,” in Proc. 2022 IEEE 8th World Forum on Internet of Things (WF-IoT), pp. 1–7 (2022). doi: 10.1109/WF-IoT54382.2022.10152031.

[24] N. Sendrier, “Code-based cryptography: State of the art and perspectives,” IEEE Security & Privacy, vol. 15, no. 4, pp. 44–50 (2017). doi: 10.1109/MSP.2017.3151345.
[25] S. Sharma, K. R. Ramkumar, A. Kaur, T. Hasija, S. Mittal, and B. Singh, “Post-quantum cryptography: A solution to the challenges of classical encryption algorithms,” in Lecture Notes in Electrical Engineering, vol. 948, pp. 23–38 (2023). doi: 10.1007/978-981-19-6383-4_3.
[26] M. K. Shathir, G. E. Arif, and R. K. K. Ajeena, “More secure on the symmetric encryption schemes based on triple vertex path graph,” Journal of Discrete Mathematical Sciences and Cryptography, vol. 26, no. 4, pp. 1175–1182 (2023). doi: 10.47974/JDMSC-1564.

Views: 110Downloads: 6Citations: 0