A quantum computer can destroy most, if not all, of the traditional cryptosystems used in practice, namely, all the systems on the basis of the integer factorization problem (e. g. RSA) or the discrete logarithm problem (both traditional and elliptic curve Diffie-Hellman and DSA, and the whole cryptography based on the pairing). Some classic cryptosystems based on computationally difficult problems are very different from the above and more difficult to solve, they are independent of the quantum computation. In this paper, a review of methods of information security based on quantum and post-quantum technologies was carried out. For each of the methods of information security based on quantum technologies are the advantages and disadvantages. Describes the system of post-quantum cryptography based on lattice theory. The results of the survey allow to formalize the direction of future research of post-quantum methods and development of new effective information security systems using quantum technologies.
A quantum computer can destroy most, if not all, of the traditional cryptosystems used in practice, namely, all the systems on the basis of the integer factorization problem (e. g. RSA) or the discrete logarithm problem (both traditional and elliptic curve Diffie-Hellman and DSA, and the whole cryptography based on the pairing). Some classic cryptosystems based on computationally difficult problems are very different from the above and more difficult to solve, they are independent of the quantum computation. In this paper, a review of methods of information security based on quantum and post-quantum technologies was carried out. For each of the methods of information security based on quantum technologies are the advantages and disadvantages. Describes the system of post-quantum cryptography based on lattice theory. The results of the survey allow to formalize the direction of future research of post-quantum methods and development of new effective information security systems using quantum technologies.
The rapid growth of quantum computing poses a critical threat to classical cryptographic systems. That is due in large part to the fact that they represent efficient solutions for some of the most challenging mathematical problems such as integer factoring or finding discrete logarithms. Schemes currently in wide use including RSA, Diffie–Hellman, and elliptic curve cryptography are particularly susceptible to being attacked by quantum computers, using algorithms like Shor's Algorithm and Grover's Algorithm. The advent of post-quantum cryptography (PQC) provides a promising potential answer to providing longterm security from adversaries using quantum computing capabilities. This paper presents a comprehensive state-of-the-art review of various PQC techniques currently being researched, including lattice-based methods, code-based methods, multivariate methods, hash-based methods, and isogeny-based methods. key challenges that will need to be addressed include computational overhead, large key sizes and implementation complexity. Furthermore the study reviews the current standardization efforts by the National Institute of Standards and Technology related to PQC and discusses some of the very specific practical considerations that need to be considered before widely deploying these techniques. The paper concludes by a complete list of existing research challenges and proposed future work that will assist in the development of efficient and scalable systems that will resist attacks from quantum computers.
The increasing advancement in quantum computing threatens the security of traditional cryptographic systems that underpin much of the modern world’s data protection. These systems rely heavily on the computational difficulty of problems like integer factorization (RSA) and elliptic curve discrete logarithms (ECC), which quantum computers could solve in polynomial time. As a result, there is an urgent need for cryptographic systems that remain secure even in the presence of quantum capabilities. Post-Quantum Cryptography (PQC) is the emerging field that aims to develop cryptographic protocols resistant to quantum-based attacks. This paper discusses the need for PQC, explores various candidate algorithms, reviews standardization efforts, and looks at the current challenges and future directions in the field.
Cryptography is an art of hiding the significant data or information with some other codes. It is a practice and study of securing information and communication. Thus, cryptography prevents third party intervention over the data communication. The cryptography technology transforms the data into some other form to enhance security and robustness against the attacks. The thrust of enhancing the security among data transfer has been emerged ever since the need of Artificial Intelligence field came into a market. Therefore, modern way of computing cryptographic algorithm came into practice such as AES, 3DES, RSA, Diffie-Hellman and ECC. These public-key encryption techniques now in use are based on challenging discrete logarithms for elliptic curves and complex factorization. However, those two difficult problems can be effectively solved with the help of sufficient large-scale quantum computer. The Post Quantum Cryptography (PQC) aims to deal with an attacker who has a large-scale quantum computer. Therefore, it is essential to build a robust and secure cryptography algorithm against most vulnerable pre-quantum cryptography methods. That is called ‘Post Quantum Cryptography’. Therefore, the present crypto system needs to propose encryption key and signature size is very large.in addition to careful prediction of encryption/decryption time and amount of traffic over the communication wire is required. The post-quantum cryptography (PQC) article discusses different families of post-quantum cryptosystems, analyses the current status of the National Institute of Standards and Technology (NIST) post-quantum cryptography standardisation process, and looks at the difficulties faced by the PQC community.
This article analyzes the threats to the security of modern cryptographic systems posed by the development of quantum computers, as well as the emergence of the concept of post-quantum cryptography as a solution to these problems. The study demonstrates that classical public-key cryptosystems, particularly RSA, DSA, and elliptic curve-based algorithms, can be broken using quantum algorithms. At the same time, new cryptographic systems based on hash functions, codes, lattices, and multivariate quadratic equations are considered a promising direction. The main challenges related to the efficiency, reliability, and applicability of post-quantum cryptography are also highlighted. As a result, the necessity of developing new cryptographic standards to ensure future information security is demonstrated.
The security of current public-key cryptosystems relies on the hardness of factoring large integers or solving discrete logarithm problems. However, these mathematical problems can be solved in polynomial time using a quantum computer. This vulnerability has prompted research into post-quantum cryptography using alternative mathematical problems that are secure in the era of quantum computers. In this regard, the National Institute of Standards and Technology (NIST) began to standardize post-quantum cryptography in 2016. In this expository article, we give an overview of recent research on post-quantum cryptography. In particular, we describe the construction and security of multivariate polynomial cryptosystems and lattice-based cryptosystems, which are the main candidates of post-quantum cryptography.
This article analyzes the threats to the security of modern cryptographic systems as a result of the development of quantum computers, as well as the formation of the concept of post-quantum cryptography as a solution to these problems. The study justifies the fact that algorithms based on classical public-key cryptosystems, notably RSA, DSA, and elliptic curves, can be corrupted using quantum algorithms. At the same time, new cryptographic systems based on hash-based, code-based, Lattice-based and multivariate quadratic equations are considered as promising directions. The main problems of Post-quantum cryptography with efficiency, reliability and applicability capabilities are also highlighted. As a result, it is indicated that it is necessary to develop new cryptographic standards to ensure future information security.