Abstract
Over the course of the previous twenty years, quantum cryptanalysis has become an important topic of research. The development of two well-known algorithms one for speedier factoring and the other for quicker searching has brought about a change in the conventional technique of computation. These algorithms are responsible for the change. A great number of the algorithms that were used in the conventional way of computing were really risk-free, precise, speedy, and output-oriented. In the post-quantum environment, it is absolutely necessary to investigate the behaviour of various classical algorithms when they are under attack. The behaviour of the RSA algorithm in terms of its resilience to attacks is the subject of investigation in this work. Deciphering the RSA codes requires the application of the Shor algorithm. In order to conduct the experiment, both the Qiskit simulator and the IBM quantum environment are utilised. The amount of qubit capacity now available is the primary determinant of how simple it is to break the RSA algorithm. One can draw the conclusion that the capacity of any quantum computer to decode RSA codes is directly dependent on the number of bits used in those codes.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Yanofsky, N., Mannucci, M.: Quantum Computing for Computer Scientists. Cambridge University Press, Cambridge (2008). https://doi.org/10.1017/CBO9780511813887
Bernstein, E., Vazirani, U.: Quantum complexity theory. SIAM J. Comput. 26(5), 1411–1473 (1997). https://doi.org/10.1137/S0097539796300921
Bennett, C.H., Bernstein, E., Brassard, G., Vazirani, U.: Strengths and weaknesses of quantum computing. SIAM J. Comput. 26(5), 1510–1523 (1997). https://doi.org/10.1137/S0097539796300933
Simon,D.: On the power of quantum computation. In: 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, Santa Fe, NM, USA, pp. 116-123 (1994). https://doi.org/10.1109/SFCS.1994.365701
Deutsch, D., Jozsa, R.: Rapid solution of problems by quantum computation. Proc. R. Soc. Lond. Ser. A: Math. Phys. Sci. 439, 553–558 (1992)
Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factoring. In: Proceedings 35th Annual Symposium on Foundations of Computer Science, Santa Fe, NM, USA, pp. 124–134 (1994). https://doi.org/10.1109/SFCS.1994.365700
Beckman, D., Chari, A., Srikrishna, D., Preskill, J.: Efficient networks for quantum factoring. Phys. Rev. A 54, 1034 (1996). https://doi.org/10.1103/PhysRevA.54.1034
Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Symposium on the Theory of Computing (1996)
Fernandez-Carames, T.M., Fraga-Lamas, P.: Towards post-quantum blockchain: a review on blockchain cryptography resistant to quantum computing attacks. IEEE Access 8, 21091–21116 (2020). https://doi.org/10.1109/ACCESS.2020.2968985
Mailloux, L.O., Lewis, C.D., II., Riggs, C., Grimaila, M.R.: Post-quantum cryptography: what advancements in quantum computing mean for IT professionals. IT Profess. 18(5), 42–47 (2016). https://doi.org/10.1109/MITP.2016.77
Zeydan, E., Turk, Y., Aksoy, B., Ozturk, S.B.: Recent advances in post-quantum cryptography for networks: a survey (2022). https://doi.org/10.1109/MobiSecServ50855.2022.9727214
Borges, F., Reis, P.R., Pereira, D.: A comparison of security and its performance for key agreements in post-quantum cryptography. IEEE Access 8, 142413–142422 (2020). https://doi.org/10.1109/ACCESS.2020.3013250
Chamola, V., Jolfaei, A., Chanana, V., Parashari, P., Hassija, V.: Information security in the post quantum era for 5G and beyond networks: threats to existing cryptography, and post-quantum cryptography. Comput. Commun. 176, C (Aug 2021), 99–118 (2021). https://doi.org/10.1016/j.comcom.2021.05.019
Stallings, W.: Cryptography and Network Security: Principles and Practice, 6th edn. Prentice Hall Press, USA (2013)
Rivest, R.L., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21, 2 (Feb. 1978), 120–126 (1978). https://doi.org/10.1145/359340.359342
Aleksandrowicz, G., et al.: Qiskit: an open-source framework for quantum computing (2019). https://doi.org/10.5281/ZENODO.2562111
IBM Quantum (2021). https://quantum-computing.ibm.com/
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Biswas, S., Das, P. (2024). Analysis of Quantum Cryptology and the RSA Algorithms Defense Against Attacks Using Shor’s Algorithm in a Post Quantum Environment. In: Dasgupta, K., Mukhopadhyay, S., Mandal, J.K., Dutta, P. (eds) Computational Intelligence in Communications and Business Analytics. CICBA 2023. Communications in Computer and Information Science, vol 1956. Springer, Cham. https://doi.org/10.1007/978-3-031-48879-5_7
Download citation
DOI: https://doi.org/10.1007/978-3-031-48879-5_7
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-48878-8
Online ISBN: 978-3-031-48879-5
eBook Packages: Computer ScienceComputer Science (R0)