Abstract
In today’s era, cryptography is used in our daily life such as health, finance, armed forces and entertainment, etc. Cryptography secured data and communications by applying mathematical transformations. Cryptography provides confidentiality, integrity, and availability (CIA triad). Codes have the capacity to encrypt and transmit data, which inspires the idea of code-based cryptography. The combination of characteristics of codes and traditional cryptography provides security against quantum attacks. In this chapter, we have reviewed the state of the art of code-based cryptography and the usefulness of rank-metric codes in the reduction of key size. We have also reviewed different code-based cryptosystems based on different types of codes, which help in reducing the key size without degrading the security level.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Stinson, D.R.: Cryptography: Theory and Practice, 63rd edn. Chapman and Hall/CRC (2005)
Menezes, A.J., Van Oorschot, P.C., Vanstone, S.A.: Applied Cryptography, p. 17. CRC, Boca Raton (1996)
Kessler, G.C.: An Overview of Cryptography (2003)
Kocher, P.C.: Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol. 1109, pp. 104–113. Springer, Heidelberg (1996). https://doi.org/10.1007/3-540-68697-5_9
Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26, 1484–1509 (1997)
Preskill, J.: Quantum computing in the NISQ era and beyond. Quantum 2, 79 (2018)
Chen, L., et al.: Report on post-quantum cryptography, vol. 12. US Department of Commerce, National Institute of Standards and Technology, USA (2016)
Malsa, N., Vyas, V., Gautam, J., Shaw, R.N., Ghosh, A.: Framework and smart contract for blockchain enabled certificate verification system using robotics. In: Bianchini, M., Simic, M., Ghosh, A., Shaw, R.N. (eds.) Machine Learning for Robotics Applications. SCI, vol. 960, pp. 125–138. Springer, Singapore (2021). https://doi.org/10.1007/978-981-16-0598-7_10
Bernstein, D.J., Lange, T., Peters, C.: Attacking and defending the McEliece cryptosystem. In: Buchmann, J., Ding, J. (eds.) PQCrypto 2008. LNCS, vol. 5299, pp. 31–46. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-88403-3_3
Berger, T.P., Loidreau, P.: How to mask the structure of codes for a cryptographic use. Des. Codes Crypt. 35, 63–79 (2005). https://doi.org/10.1007/s10623-003-6151-2
Otmani, A., Tillich, J.-P., Dallot, L.: Cryptanalysis of two McEliece cryptosystems based on quasi-cyclic codes. Math. Comput. Sci. 3(2), 129–240 (2010)
Faugère, J.-C., Otmani, A., Perret, L., De Portzamparc, F., Tillich, J.-P.: Structural cryptanalysis of McEliece schemes with compact keys. Des., Codes Crypt. 79(1), 87–112 (2015)
Horlemann, A.L., Puchinger, S., Renner, J., Schamberger, T., Wachter-Zeh, A.: Information-Set Decoding with Hints. In: Wachter-Zeh, A., Bartz, H., Liva, G. (eds.) Code-Based Cryptography. CBCrypto 2021. Lecture Notes in Computer Science, vol. 13150. Springer, Cham (2022). https://doi.org/10.1007/978-3-030-98365-9_4
Niederhagen, R., Waidner, M.: Practical post-quantum cryptography. Fraunhofer SIT (2017)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Singh, M.K. (2023). Code-Based Cryptography: A Comparative Study of Key Sizes. In: Shaw, R.N., Paprzycki, M., Ghosh, A. (eds) Advanced Communication and Intelligent Systems. ICACIS 2022. Communications in Computer and Information Science, vol 1749. Springer, Cham. https://doi.org/10.1007/978-3-031-25088-0_32
Download citation
DOI: https://doi.org/10.1007/978-3-031-25088-0_32
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-25087-3
Online ISBN: 978-3-031-25088-0
eBook Packages: Computer ScienceComputer Science (R0)