The continuous development of quantum computing requires the development of cryptographic algorithms resistant to quantum cryptanalysis. Therefore, the National Institute of Standards and Technology (NIST) is holding a competition to standardize algorithms in the post-quantum period, including Crystals-Dilithium, Falcon, and Sphincs+ for digital signatures. In order to determine the ways of development and ways to improve the existing methods of cryptographic protection and electronic digital signature (EDS), an urgent task arose to assess the effectiveness (stability and computational complexity) of existing EDS algorithms. In this paper, a comparative evaluation of EDS algorithms was carried out by key indicators. Research results show the disadvantages and advantages of each algorithm, taking into account the importance of context-specific use. The conclusions indicate that Dilithium has the lowest load on the system's computing resources, Falcon stands out for its signature verification speed, and Sphincs+ provides reliable security. The capabilities of existing cryptographic transformation algorithms based on elliptic curves do not meet the growing need of authentication algorithms resistance to quantum cryptanalysis, and the use of modern candidates for the post-quantum cryptography standard does not allow for a short-term transition to the usage of new cryptographic algorithms in information systems. The paper also points out the impossibility of simultaneous transition to potentially quantum cryptanalysis-resistant algorithms in existing information systems. The direction of further research is the development of new cryptoalgorithms and methods that will ensure the integrity and confidentiality of information during its transmission over unprotected channels in the transition period to the widespread use and implementation of post-quantum cryptography standards.
The continuous development of quantum computing requires the development of cryptographic algorithms resistant to quantum cryptanalysis. Therefore, the National Institute of Standards and Technology (NIST) is holding a competition to standardize algorithms in the post-quantum period, including Crystals-Dilithium, Falcon, and Sphincs+ for digital signatures. In order to determine the ways of development and ways to improve the existing methods of cryptographic protection and electronic digital signature (EDS), an urgent task arose to assess the effectiveness (stability and computational complexity) of existing EDS algorithms. In this paper, a comparative evaluation of EDS algorithms was carried out by key indicators. Research results show the disadvantages and advantages of each algorithm, taking into account the importance of context-specific use. The conclusions indicate that Dilithium has the lowest load on the system's computing resources, Falcon stands out for its signature verification speed, and Sphincs+ provides reliable security. The capabilities of existing cryptographic transformation algorithms based on elliptic curves do not meet the growing need of authentication algorithms resistance to quantum cryptanalysis, and the use of modern candidates for the post-quantum cryptography standard does not allow for a short-term transition to the usage of new cryptographic algorithms in information systems. The paper also points out the impossibility of simultaneous transition to potentially quantum cryptanalysis-resistant algorithms in existing information systems. The direction of further research is the development of new cryptoalgorithms and methods that will ensure the integrity and confidentiality of information during its transmission over unprotected channels in the transition period to the widespread use and implementation of post-quantum cryptography standards.
Background. The work examines the development and promotion of post-quantum standards, as well as the analysis and improvement of existing algorithms, on the basis of which the functioning of standards in the field of electronic digital signature can be based. One of the main reasons was also the migration of classical cryptography to post-quantum cryptography. The robot is aligning three popular post-quantum standards: CRYSTALS-Dilithium, Falcon and SPHINCS+. As a result of the investigation, the most optimal standards were selected before implementation of classical electronic signature schemes. The article is dedicated to the development and promotion of post-quantum standards in the field of electronic digital signature. It is also necessary to analyze and level up existing algorithms, on the basis of which the functioning of such standards can be based. The research is considered relevant due to the growing interest in quantum technologies and the need for secure electronic communications in the upcoming quantum world. Мethods. Мigrating classical cryptography to post-quantum cryptography. However, power is important, because the power of quantum computers can be affected by certain cryptographic algorithms. An analysis of the feasibility of transitioning to new standards and their existing security capabilities is also carried out. In addition, three popular post-quantum standards are being updated: CRYSTALS-Dilithium, Falcon and SPHINCS+. This allows us to determine the most optimal and reliable standard for implementation of classical electronic signature schemes. The authors of the work carry out the selection of the optimal standard, ensuring the safety and security of its authorities. Results. Сontains important results from the study of post-quantum standards for electronic digital signatures, which may be useful for developers of cryptographic software and information security engineers. The power supply to the influences and changes in the advanced post-quantum standards, such as the complexity of implementation, the flexibility of infrastructure and power standardization, are thoroughly examined. The prospects for the future development of post quantum cryptography and its influx into modern electronic signature systems have also been highlighted. This will help readers to take away the more common sense and context of the importance and potential contributions in this area. Conclusions. Falcon and CRYSTALS-Dilithium have a high signing fluidity and a larger key size, making them practical for rich stagnation. SPHINCS+, regardless of its viscosity, has less fluidity and requires a larger key size. The choice between CRYSTALS-Dilithium, Falcon and SPHINCS+ will depend on the specific drying needs, as well as compromises between fluidity, key size and viscosity. This demonstrates the high speed of subscription, and this is one of its key advantages. It is intended for use in quick operations, for example, on servers and industrial systems.
The continuous development of quantum computing necessitates the development of quantum-resistant cryptographic algorithms. In response to this demand, the National Institute of Standards and Technology selected standardized algorithms including Crystals-Dilithium, Falcon, and Sphincs+ for digital signatures. This paper provides a comparative evaluation of these algorithms across key metrics. The results indicate varying strengths and weaknesses for each algorithm, underscoring the importance of context-specific deployments. Our findings indicate that Dilithium offers advantages in low-power scenarios, Falcon excels in signature verification speed, and Sphincs+ provides robust security at the cost of computational efficiency. These results underscore the importance of context-specific deployments in specific and resource-constrained technological applications, like IoT, smart cards, blockchain, and vehicle-to-vehicle communication.
The National Institute of Standards and Technology (NIST) has recently concluded the third round of its Post Quantum Cryptography Standardization Process, selecting four finalist algorithms for standardization: CRYSTALS Kyber, CRYSTALS-Dilithium, FALCON, and SPHINCS+. These algorithms are designed to withstand attacks from both classical and quantum computers, ensuring the long-term security of digital communications. This paper presents a comprehensive comparative analysis of the security margins and practical deployment readiness of these finalist algorithms. CRYSTALS-Kyber, a key encapsulation mechanism based on the hardness of the Module Learning With Errors problem, offers strong security and efficient performance. CRYSTALS-Dilithium, a digital signature algorithm based on module lattices, provides robust security guarantees and relatively straightforward implementation. FALCON, a lattice-based digital signature algorithm utilizing the Fast Fourier Transform, offers compact signatures and fast verification but faces implementation challenges due to its reliance on floating-point arithmetic. SPHINCS+, a hash-based signature scheme, stands out as a conservative choice with security based solely on the well-established security of hash functions. The analysis reveals that while each algorithm has its strengths, they also face unique challenges in terms of side-channel vulnerabilities, formal security proofs, and performance trade-offs. The practical deployment of these algorithms requires careful consideration of specific security requirements, performance needs, and resource constraints. Ongoing research efforts aim to enhance the algorithms' resistance against advanced attacks, optimize their performance across diverse platforms, and develop standardized and secure hybrid cryptographic systems. The transition to post-quantum cryptography will involve challenges such as interoperability with legacy systems, the need for clear standards and regulatory guidance, and the costs associated with software and hardware updates. Continued engagement with the cryptographic community and monitoring of the evolving security landscape will be crucial for ensuring a secure and effective migration to post-quantum cryptography.
An important feature of the post-quantum period in cryptography is the significant uncertainty regarding the source data for cryptanalysis and counteraction in terms of the capabilities of quantum computers, their mathematical and software, as well as the application of quantum cryptanalysis to existing cryptotransformations and cryptoprotocols. Mathematical methods of digital signature (DS) have been chosen as the main methods of NIST USA, which have undergone significant analysis and substantiation in the process of extensive research by cryptographers and mathematicians at the highest level. They are described in detail and studied at the first stage of the US NIST International Competition. In the second round, a number of decisions were made to merge some candidates for the post-quantum DS standard. 9 candidates were left for further research at the 2nd round: Crystals-Dilithium, Falcon, GeMSS, LUOV, MQDSS, Picnic, qTESLA, Rainbow and SPHINCS+. Three of them (Dilithium, Falcon, qTeSLA) are based on the stability of algebraic lattices (Lattice-based), four (GeMSS, LUOV, MQDSS, Rainbow) are based on multivariate transformations (MQ-transformations), one (SPHINCS+) is based on the stability of hash-function, one (Picnic) is based on the stability of the hash-function and block stream ciphers. During the 2nd round of the US NIST Competition the following finalist algorithms and alternative algorithms were selected as digital signatures according to the results of research on promising post-quantum cryptographic algorithms. As finalists algorithms such DS algorithms as Crystals-Dilithium, Falcon and Rainbow. Alternative algorithms are GeMSS, Picnic and SPHINCS+ were selected. This paper studies the peculiarities of construction of the digital signature algorithm considered as a candidate for the promising post-quantum standard of the NIST PQC competition – Picnic, also it analyzes the protection of the algorithm from known attacks. Data from the comparison of post-quantum algorithms such as digital signature are given. The description of the Picnic algorithm and its parameters are given.
The development of quantum computers is one of the most significant technological developments of our time, opening new horizons in computing capabilities. However, it also poses serious threats to existing cryptographic algorithms, which are the basis of the security of modern information systems. The paper presents the results of research on post-quantum cryptography and its role in ensuring information security in the context of the development of quantum computers. The purpose of this paper is to compare modern post-quantum, i.e., quantum-stable cryptographic algorithms, assess their applicability for different classes of tasks, and predict the development paths of cryptographic methods for information protection. To achieve this goal, methods of comparative analysis and mathematical modeling are used, which allow for assessing the effectiveness and security of algorithms in different conditions. The study results show that post-quantum algorithms provide reliable information protection in the context of potential quantum attacks while maintaining a high-efficiency level. The conclusions emphasize the need to adapt existing cryptographic systems to new security requirements, particularly through integrating post-quantum algorithms into cloud services and blockchain technologies. The research results can be used to improve data protection mechanisms in information systems and to develop new cryptographic standards in the era of quantum computing. Therefore, plans for future research are outlined, namely: the effectiveness of implementing post-quantum algorithms in various industries, including finance, medicine, and government, will be analyzed; methods for optimizing cryptographic systems will be developed to ensure a balance between security and performance; new mathematical approaches will be studied that can be used to create quantum-resistant algorithms.
An important feature of the transition and post-quantum period is the application of new mathematical methods to counteract quantum cryptanalysis. The world cryptographic community pays special attention to the open competition for the post-quantum standard of electronic signature. The problem is to prove the stability of new mathematical methods for the synthesis of transformations such as electronic signature, in particular with the use of algebraic lattices. The existing algorithms of electronic signature of the 2nd stage of the NIST competition are analyzed. Among the selected candidates for the EP 2 standard, 3 of the 3 algorithms are based on algebraic lattices, CRYSTALS-DILITHIUM and FALCON. The NIST has issued a statement saying that it is most likely that one of the algorithms will be chosen due to the same mathematical basis used in both algorithms. The main attacks on electronic signature algorithms based on the problem of learning with errors, as well as the parameters of the EP Dilithium algorithm, which affect the stability and complexity of transformations, are considered. Methods for generating system-wide parameters of stability levels of 512 bits of classical and 256 bits of quantum security, as well as the protection of the algorithm againstfrom attacks by third-party channels are considered. The dependence of the time of electronic signature production on the keys is analyzed. The results of calculations for the level of stability 512/256 are given, and also recommendations on the choice of system-wide parameters are given. The results of the 2nd stage of the NIST competition of post quantum cryptographic algorithms, as well as the prospects of standardization of transformations such as electronic signature at the 3rd stage are considered. Conclusions are made about the need for a more detailed study of attacks on algorithms based on the problem of learning with errors, as well as the importance of generating system-wide parameters of higher levels.