ENHANCING CYBERSECURITY MEASURES IN IOT DEVICES THROUGH MACHINE LEARNING ALGORITHMS
Abstract
Quantum computing represents a paradigm shift in computational capabilities, offering exponential speedups for specific problems. This paper explores the significant impact quantum computing could have on cryptography. The potential threats posed by quantum algorithms, particularly Shor's and Grover's algorithms, to traditional cryptographic systems are discussed. Moreover, we explore emerging quantum-resistant cryptographic techniques and the future of secure communications in the quantum era.
References
- Nielsen, M. A., & Chuang, I. L. (2010). Quantum computation and quantum information (10th Anniversary ed.). Cambridge University Press.
- Shor, P. W. (1997). Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal on Computing, 26(5), 1484-1509. https://doi.org/10.1137/S0097539795293172
- Bernstein, D. J., Buchmann, J., & Dahmen, E. (2009). Post-quantum cryptography. Springer.
- Bennett, C. H., & Brassard, G. (1984). Quantum cryptography: Public key distribution and coin tossing. In Proceedings of IEEE International Conference on Computers, Systems, and Signal Processing (pp. 175-179). IEEE.

This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
Copyright (c) 2024 Pavlo Tishkov