Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Radiotekhnika

Analysis of the possibilities and peculiarities of programming cryptology problems on a quantum computer

Yevhenii Kaptol, І.Д. Горбенко

Published Sep 16, 2020• 5 citations
Publisher

Abstract

This paper is devoted to detailing the possibilities and features of quantum computer use for cryptological problems, their demonstration, justification of approaches to the possibilities analysis and studying features of cryptanalysis problems programming on quantum computers. The possibilities and availability of hardware for solving cryptanalysis problems through quantum methods are analyzed and existing restrictions of their use are determined. The quantum computer and quantum computer programming features are considered. The possibilities of quantum computer use for cryptanalysis are also considered with the Grover’s method example. The essence of Grover’s method and features of its application for cryptanalysis are given. An example of its application to the search space which is represented by a quantum register of 56 qubits is given as well. The quantum computer application of Grover’s method on quantum computer accessible through a loud service is considered. Schemes for conducting a search by Grover's method for quantum computer application are developed, containing a different number of Grover iterations to study the need for executing a full cycle, the possibility to stop and evaluate search results at a certain stage. The developed circuits are tested on quantum computers with different architectures and on a quantum simulator provided for the analysis of circuits intended to run on a quantum computer. The comparison of the expected and obtained results of the Grover’s method application at different search stages on quantum computer is given.

DOI
10.30837/rt.2020.3.202.03

Related papers

Essence and features of Grover’s method implementation on a classical computer for symmetric cryptanalysis

Yuriy Gorbenko, Ye.Yu. Kaptyol

This paper is devoted to detailing, mastering for use, checking cryptanalytic properties and demonstrating the use of Grover’s method for cryptanalysis of symmetric cryptographic transformations. The essence of the method and its refinement are presented in order to implement Grover’s quantum algorithm on a classical computer.

Radiotekhnika•Dec 28, 2018•0 citations

Analysis of the possibility of quantum computers and quantum computings for cryptanalysis of modern cryptosystems

Юрій Іванович Горбенко, Роман Сергійович Ганзя

The main trends of the science and technology development in the field of quantum physics and quantum calculations are considered in the paper. It has been shown that over the past few years plenty of new discoveries and achievements have been made in the field of quantum physics, all these events, anyway, had a great influence on the invention and production of quantum computers. Many communities around the world have been engaged in the development of quantum computers and some of them have achieved significant results in it by now.It is shown that using quantum algorithms of Shor and Grover, which can be fulfilled on a properly implemented quantum computer, can compromise some symmetric and asymmetric cryptosystems. The analysis results of endurance of the known block ciphers regarding the quantum cryptanalysis are given. It is also shown that some of them are not able to resist the quantum cryptanalysis method based on Grover's algorithm. The analysis of Shor's algorithm possibilities, which can significantly reduces computational costs for solving mathematical problems of endurance of modern asymmetric cryptoalgorithms, is given. Herewith, Shor's quantum algorithm diminishes the complexity of the cryptanalysis from exponential and subexponential to polynomial. In addition, the assessment of quantum computer resources is given in the paper, which are necessary for the quantum cryptanalysis concerning such cryptosystems as DSA, RSA, EC and NTRU.

Eastern-European Journal of Enterprise Technologies•Feb 5, 2014•3 citations

The Relevance of Quantum Cryptanalysis

Alexei Petrenko, Sergei Petrenko

This chapter shows the relevance of solving practical issues of quantum cryptanalysis to ensure the required cybersecurity digital economy. It presents the analysis of the well-known national quantum initiatives and programs in technologically advanced countries of the world. The chapter also shows the role and place of applied quantum cryptanalysis in modern cryptology search studies. It reveals the main prerequisites and scientific foundations for solving practical problems of quantum cryptanalysis based on the algorithms of Shor , Grover , Simon , etc. The chapter explains the potential vulnerabilities of modern blockchain systems to typical quantum crypto attacks. It defines the basic requirements for promising methods, algorithms, and software of quantum cryptanalysis. An effective quantum attack will be to search for the private key when the public key is revealed after the broadcast of the signed transaction to the network. This allows an attacker to sign a new transaction using a private key, posing as the key owner.

River Publishers eBooks•Feb 7, 2023•0 citations

Quantum Cryptanalysis of Affine Cipher

Mahima Mary Mathews, V. Panchami, Vishnu Ajith

Quantum Algorithms reduce the computational complexity or solve certain difficult problems that were originally impossible to solve with classical computers. Grover’s search algorithm is a Quantum computation algorithm that can find target elements from a set of unstructured data with the best possible,$O(\sqrt {N})$queries. Grover’s search Quantum circuits implemented accurately can be used to successfully search and find the keys of Symmetric ciphers. However, very few demonstrations of such practical cryptanalysis are available. In this paper, practical Quantum cryptanalysis circuits for Affine Cipher are proposed and demonstrated, that successfully break the cipher by finding the keys.

IEEE Journal on Emerging and Selected Topics in Circuits and Systems•Jul 15, 2024•4 citations

Development of Quantum Cryptanalysis Algorithms

Alexei Petrenko, Sergei Petrenko

This chapter evaluates the stability of the modern cryptographic algorithms to clarify the tasks of cryptanalysis of asymmetric encryption schemes and digital signature based on factorization and discrete logarithm problems in various algebraic structures in a quantum computing model. It considers the features of modeling quantum cryptanalysis algorithms on a quantum scheme, and shows the differences between these algorithms and classical algorithms. The quantum algorithm is performed by implementing a series of sequential unitary operations. Grover's algorithm provides a quadratic increase in speed, while some other quantum algorithms, for example, the Shor factorization algorithm, give an exponential gain compared to the corresponding classical algorithms. Grover's algorithm is modified into an algorithm for recovering the symmetric encryption key from the message text and ciphertext. The stability of the RSA asymmetric encryption system is based on the super-polynomial computational complexity of factorization of natural numbers. However, there is a quantum algorithm whose complexity is polynomial.

River Publishers eBooks•Feb 7, 2023•3 citations

COMPARATIVE ANALYSIS OF QUANTUM AND CLASSICAL ALGORITHMS IN MODERN COMPUTING

Y.U. Serdaliyev, А.С. Баймаханова

This article is an overview and comparative analysis of quantum and classical algorithms in the field of computing. In the modern world, there is a period of development of high technologies. In this age, it is very effective to realize the goals that humanity has set for itself, not only using the human brain, but also using the thinking properties of the machine. The areas of artificial intelligence and machine learning are developing very rapidly, which allows you to solve tasks that were previously considered exclusively human prerogative. For the classical approach, a quick sort is used to preorder the list, and then the target element is searched. The quantum approach uses Grover's algorithm, which takes advantage of quantum computing to quickly find an item in an unordered list. The comparison results include the execution time of each algorithm and the elements found. This work demonstrates the potential of quantum algorithms in solving search problems and provides a practical example of comparing classical and quantum methods. Machine learning is the main way to optimize and automate processes in production and other industries. quantum computing performed on quantum computers and its own state «quantum machine learning» is the technology of the future. However, despite all the advantages, these technologies are currently poorly studied. Based on a literature review, the formulation of hypotheses, the use of programming methods and the conduct of experiments, the study provides new insights into the application of different types of algorithms to different problems. The results highlight the unique advantages of quantum algorithms in highly specialized problems, the limitations in their use due to technological calls, and suggest a hybrid approach as the future of computing.

Q A Iasaýı atyndaǵy Halyqaralyq qazaq-túrіk ýnıversıtetіnіń habarlary (fızıka matematıka ınformatıka serııasy)•Mar 30, 2024•0 citations
This paper is devoted to detailing the possibilities and features of quantum computer use for cryptological problems, their demonstration, justification of approaches to the possibilities analysis and studying features of cryptanalysis problems programming on quantum computers. The possibilities and availability of hardware for solving cryptanalysis problems through quantum methods are analyzed and existing restrictions of their use are determined. The quantum computer and quantum computer programming features are considered. The possibilities of quantum computer use for cryptanalysis are also considered with the Grover’s method example. The essence of Grover’s method and features of its application for cryptanalysis are given. An example of its application to the search space which is represented by a quantum register of 56 qubits is given as well. The quantum computer application of Grover’s method on quantum computer accessible through a loud service is considered. Schemes for conducting a search by Grover's method for quantum computer application are developed, containing a different number of Grover iterations to study the need for executing a full cycle, the possibility to stop and evaluate search results at a certain stage. The developed circuits are tested on quantum computers with different architectures and on a quantum simulator provided for the analysis of circuits intended to run on a quantum computer. The comparison of the expected and obtained results of the Grover’s method application at different search stages on quantum computer is given.
The main trends of the science and technology development in the field of quantum physics and quantum calculations are considered in the paper. It has been shown that over the past few years plenty of new discoveries and achievements have been made in the field of quantum physics, all these events, anyway, had a great influence on the invention and production of quantum computers. Many communities around the world have been engaged in the development of quantum computers and some of them have achieved significant results in it by now.It is shown that using quantum algorithms of Shor and Grover, which can be fulfilled on a properly implemented quantum computer, can compromise some symmetric and asymmetric cryptosystems. The analysis results of endurance of the known block ciphers regarding the quantum cryptanalysis are given. It is also shown that some of them are not able to resist the quantum cryptanalysis method based on Grover's algorithm. The analysis of Shor's algorithm possibilities, which can significantly reduces computational costs for solving mathematical problems of endurance of modern asymmetric cryptoalgorithms, is given. Herewith, Shor's quantum algorithm diminishes the complexity of the cryptanalysis from exponential and subexponential to polynomial. In addition, the assessment of quantum computer resources is given in the paper, which are necessary for the quantum cryptanalysis concerning such cryptosystems as DSA, RSA, EC and NTRU.
This chapter shows the relevance of solving practical issues of quantum cryptanalysis to ensure the required cybersecurity digital economy. It presents the analysis of the well-known national quantum initiatives and programs in technologically advanced countries of the world. The chapter also shows the role and place of applied quantum cryptanalysis in modern cryptology search studies. It reveals the main prerequisites and scientific foundations for solving practical problems of quantum cryptanalysis based on the algorithms of Shor , Grover , Simon , etc. The chapter explains the potential vulnerabilities of modern blockchain systems to typical quantum crypto attacks. It defines the basic requirements for promising methods, algorithms, and software of quantum cryptanalysis. An effective quantum attack will be to search for the private key when the public key is revealed after the broadcast of the signed transaction to the network. This allows an attacker to sign a new transaction using a private key, posing as the key owner.
Quantum Algorithms reduce the computational complexity or solve certain difficult problems that were originally impossible to solve with classical computers. Grover’s search algorithm is a Quantum computation algorithm that can find target elements from a set of unstructured data with the best possible,O(N)O(\sqrt {N})O(N​)queries. Grover’s search Quantum circuits implemented accurately can be used to successfully search and find the keys of Symmetric ciphers. However, very few demonstrations of such practical cryptanalysis are available. In this paper, practical Quantum cryptanalysis circuits for Affine Cipher are proposed and demonstrated, that successfully break the cipher by finding the keys.
This chapter evaluates the stability of the modern cryptographic algorithms to clarify the tasks of cryptanalysis of asymmetric encryption schemes and digital signature based on factorization and discrete logarithm problems in various algebraic structures in a quantum computing model. It considers the features of modeling quantum cryptanalysis algorithms on a quantum scheme, and shows the differences between these algorithms and classical algorithms. The quantum algorithm is performed by implementing a series of sequential unitary operations. Grover's algorithm provides a quadratic increase in speed, while some other quantum algorithms, for example, the Shor factorization algorithm, give an exponential gain compared to the corresponding classical algorithms. Grover's algorithm is modified into an algorithm for recovering the symmetric encryption key from the message text and ciphertext. The stability of the RSA asymmetric encryption system is based on the super-polynomial computational complexity of factorization of natural numbers. However, there is a quantum algorithm whose complexity is polynomial.
This article is an overview and comparative analysis of quantum and classical algorithms in the field of computing. In the modern world, there is a period of development of high technologies. In this age, it is very effective to realize the goals that humanity has set for itself, not only using the human brain, but also using the thinking properties of the machine. The areas of artificial intelligence and machine learning are developing very rapidly, which allows you to solve tasks that were previously considered exclusively human prerogative. For the classical approach, a quick sort is used to preorder the list, and then the target element is searched. The quantum approach uses Grover's algorithm, which takes advantage of quantum computing to quickly find an item in an unordered list. The comparison results include the execution time of each algorithm and the elements found. This work demonstrates the potential of quantum algorithms in solving search problems and provides a practical example of comparing classical and quantum methods. Machine learning is the main way to optimize and automate processes in production and other industries. quantum computing performed on quantum computers and its own state «quantum machine learning» is the technology of the future. However, despite all the advantages, these technologies are currently poorly studied. Based on a literature review, the formulation of hypotheses, the use of programming methods and the conduct of experiments, the study provides new insights into the application of different types of algorithms to different problems. The results highlight the unique advantages of quantum algorithms in highly specialized problems, the limitations in their use due to technological calls, and suggest a hybrid approach as the future of computing.