Analysis of the limitations of quantum computing in cryptoanalysis problems

Authors

DOI:

https://doi.org/10.30837/rt.2025.1.220.08

Keywords:

quantum computer, postquantum cryptography, cryptanalysis, NISQ, EFTQC, FTQC

Abstract

The NISQ era is a transitional phase in the development of quantum computing with a limited number of qubits and high noise levels. In response to the limitations, specialized algorithms have been developed, such as the variational quantum eigenvalue algorithm (VQE) for modeling molecular structures, and QAOA for solving combinatorial optimization problems. To reduce the impact of noise on the calculations, effective strategies are used: randomized compilation (RC) and zero-noise extrapolation (ZNE). Hybrid quantum-classical approaches are also being developed that combine quantum generation with classical optimization and processing methods. Potential areas of application of NISQ technologies include the optimization of logistics problems, financial modeling, and supply chain optimization. In cryptography, NISQ devices stimulate the development of quantum-resistant encryption algorithms. The main challenges remain the limited scalability of systems and the problem of noise in quantum computing. The search for new architectures, including topological qubits and "glass" chips for a more stable environment, continues. An important trend is the gradual transition to the era of fully fault-tolerant quantum computers (FTQC), expected in the period 2025-2029. Unlike NISQ, which focuses on noise reduction methods, FTQC implements full quantum error correction (QEC). Quantum computing has transformed from an academic discipline into a field with a clear commercial strategy. Despite current limitations, existing achievements open up real opportunities for the applied use of quantum computing in cryptography. The analysis of mathematical criteria of different eras of quantum computing development has implications for solving cryptanalytic problems, transforming the understanding of the time frames and methodological approaches to overcoming cryptographic protection of classical cryptosystems.

References

Arute F., Arya K., Babbush R., Bacon D., Bardin J. C., Barends R., Biswas R., Boixo S., Brandao F. G. S. L., Buell D. A., Burkett B., Chen Y., Chen Z., Chiaro B., Collins R., Courtney W., Dunsworth A., Farhi E., Foxen B., ... Martinis J. M. Quantum supremacy using a programmable superconducting processor // Nature. 2019. Vol. 574(7779). P. 505–510. https://doi.org/10.1038/s41586-019-1666-5

Kandala A., Mezzacapo A., Temme K., Takita M., Brink M., Chow J. M., Gambetta J. M. Hardware-efficient variational quantum eigensolver for small molecules and quantum magnets // Nature. 2017. Vol. 549(7671). P. 242–246. https://doi.org/10.1038/nature23879

Kotukh E., Severinov O., Vlasov A., Tenytska A., Zarudna E. Some results of development of cryptographic transformation schemes using non-abelian groups // Radiotekhnika. 2021. No 204. P. 66–72. https://doi.org/10.30837/rt.2021.1.204.07

Khalimov G., Kotukh Y., Sergiychuk Y., Marukhnenko A. Analysis of the implementation complexity of the cryptosystem on the Suzuki group // Radiotekhnika. 2018. No 193. P. 75–81.

https://doi.org/10.30837/rt.2018.2.193.08

Kotukh Y., & Khalimov G. Hard problems for non-abelian cryptography // 2021: Fifth International Scientific and Technical Conference "computer and information systems and technologies" https://doi.org/10.30837/csitic52021232176

Kotukh Y., Khalimov G. Towards practical cryptoanalysis of systems based on word problems and logarithmic signatures // Information security: problems and prospects. https://shorturl.at/IaByX

Shor P. W. Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Com-puter // SIAM Journal on Computing. 1997. No 26(5). Р. 1484–1509. https://epubs.siam.org/doi/10.1137/S0097539795293172

Gidney C., & Ekerå M. How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits. Quan-tum. 2021. No 5. 433 p. https://doi.org/10.22331/q-2021-04-15-433

Kotukh Y., Khalimov G. Advantages of logarithmic signatures in the implementation of crypto primitives // Challenges and Issues of Modern Science. https://cims.fti.dp.ua/j/article/download/119/158

Kotukh Y. Quantum cryptoanalysis of prospective asymmetric cryptosystems // Proceedings of conference “Cybersecurity in energy sector”. https://shorturl.at/1pbcK

Preskill J. Quantum Computing in the NISQ era and beyond // Quantum. 2018. No 2. P. 79. https://doi.org/10.22331/q-2018-08-06-79

Published

2025-04-10

How to Cite

Kotukh, Y., Khalimov, G., Korobchynskyi, M., & Dzhura, I. (2025). Analysis of the limitations of quantum computing in cryptoanalysis problems. Radiotekhnika, (220), 92–101. https://doi.org/10.30837/rt.2025.1.220.08

Issue

Section

Articles