Facing the challenge of developing quantum computers, quantum-resistant digital signature algorithms have been developed based on hash functions and have received the attention of many scientists. This paper focuses on evaluating hash function-based quantum-resistant digital signature algorithms and their applicability in protecting transmitted information. Analyzing, synthesizing and comparing the strengths and limitations of the algorithms is the main research method of the paper. It also highlights the challenge of applying them in different fields such as banking, e-commerce, and government. The article is useful for those who are just starting to study quantum-resistant digital signatures, helping them get an overview of the field. It also assists regulators, governments and other organizations in making decisions and policies regarding digital signature security platforms.
Facing the challenge of developing quantum computers, quantum-resistant digital signature algorithms have been developed based on hash functions and have received the attention of many scientists. This paper focuses on evaluating hash function-based quantum-resistant digital signature algorithms and their applicability in protecting transmitted information. Analyzing, synthesizing and comparing the strengths and limitations of the algorithms is the main research method of the paper. It also highlights the challenge of applying them in different fields such as banking, e-commerce, and government. The article is useful for those who are just starting to study quantum-resistant digital signatures, helping them get an overview of the field. It also assists regulators, governments and other organizations in making decisions and policies regarding digital signature security platforms.
Due to the need to maintain confidentiality, redundancy, and openness, the usage of Blockchain and other DLTs has dramatically advanced in recent years, and is being recommended for various applications. In blockchain, these capabilities are supplied by means of hash functions and public-key encryption. However, the rapid development of quantum computation in the near future has opened the door to the Grover and Shor algorithms. These algorithms challenge both public and hash encryption, causing blockchains to redesign and use quantum attack-tolerant cryptosystems; this produces cryptosystems which are considered post-quantum cryptosystems, which are quantum-resistant. This paper reviews current scientists on quantum blockchain for such purposes. In addition, the major challenges are studied with the most important post-quantum blockchain systems. In addition, the most promising post quantum signature encryption and digital blockchain signature schemes are detailed in terms of the functionality and durability of the most promising public signatures. In this article, researchers and developers in blockchain have an extensive perspective and practical advice on post-quantum blockchain protection.
The rapid advancement of quantum computing technology presents a significant challenge to the field of cryptography, particularly affecting the security of hash functions that form the foundation of many cryptographic protocols. Hash functions are widely used to ensure data integrity, generate digital signatures, and securely store passwords. However, the emergence of quantum algorithms—such as Grover’s algorithm—threatens to undermine the security assumptions on which these hash functions are based by significantly reducing their effective security levels. This paper aims to provide a comprehensive analysis of the vulnerabilities introduced by quantum computing to traditional hash functions, detailing how these weaknesses can be exploited by quantum adversaries. We explore the fundamental properties of hash functions, including pre-image resistance, second pre-image resistance, and collision resistance, and assess how these properties are affected in a quantum context. Furthermore, we examine the implications of these vulnerabilities for existing cryptographic systems and emphasize the urgent need for the development of post-quantum cryptographic standards. In response to these challenges, we review ongoing research efforts focused on designing hash functions that are resilient to quantum attacks. We evaluate several promising candidates for post-quantum hash functions, considering their security properties, performance metrics, and practical applicability. The findings of this paper highlight the necessity of transitioning to post-quantum cryptographic solutions to safeguard sensitive information in an increasingly quantum-capable world. Ultimately, we advocate for proactive measures within the cryptographic community to adopt and implement these new standards, thereby ensuring robust data security in the age of quantum computing.
The use of public key cryptosystems range from securely encrypting emails and files to creating digital signatures for non-repudiation. The security of public key cryptosystems is based on computationally "unsolvable" complex mathematical problems. This tends to change with the introduction of quantum computers that undoubtedly pose a threat to the current schemes. In response to that extensive research has been conducted that resulted in several cryptosystems that are believed to be quantum resistant. This thesis presents a concise overview of multiple hash-based signature schemes and provides a comparative description and analysis of them. The comparisons are based on different signature scheme properties, such as key sizes, signature sizes and security level provided. The proposed quantum resistant schemes are also compared to the standard schemes used today, such as RSA and ECDSA.
In the era of active information technologies and device development, the emergence of portable and general-purpose quantum computers is only a matter of time. And although the benefit of their many times greater efficiency, compared to ordinary bit computers, will be obvious, at the same time, they will bring many vulnerabilities to modern algorithms of cryptography and cybersecurity. To prevent this from happening, society has already started researching post-quantum protocols to replace modern ones. Digital signature protocols were no exception. Thus, one of the approaches was constructing post-quantum digital signature protocols based on hash functions. The first representatives were schemes of one-time signatures based on hash functions, which were protected from the capabilities of quantum computers but had the obvious disadvantage of one-time use. The most famous is the so-called Lamport one-time signature. However, this disadvantage of one-time use has been solved by proposing different schemes of multi-time digital signatures based on the creation and use of many one-time signatures. Thus, chain-based and tree-based schemes of multi-time signatures were proposed. This work is devoted to the implementation and comparison of various multi-time signature schemes. During the research, theoretical estimates of memory usage and time required for the operations of various schemes were given. Further implementation of these schemes and final measurements showed the correspondence of theoretical estimates with empirical results and clearly demonstrated the advantages and disadvantages of different schemes. Thus, tree-based schemes showed the best performance, especially those where the tree is built sequentially. However, in certain cases, it makes sense to use a tree with full-depth construction. Due to the relative novelty and small amount of research in this field, multi-time digital signatures have much room for further research, for example, considering N-ary trees and comparing them with binary ones.
This study investigates the performance and security of quantum-resistant cryptographic algorithms, assessing their potential to protect data from quantum computing threats. The research evaluates various cryptographic techniques, including lattice-based, code-based, hash-based, and isogeny-based systems, comparing them in terms of encryption and decryption speeds, memory consumption, computational overhead, and resistance to quantum attacks.Lattice-based algorithms require increased amounts of memory and computational resources yet maintain low simulated attack success rates which makes them optimal for quantum resistance. Research established hash-based cryptosystems operated faster but scientists proved them to be vulnerable to quantum attacks. Scientific experts demonstrated hybrid cryptographic systems based on conventional and quantum-resistant algorithms as a viable security-speed compromise solution. Lattice-based systems maintain the highest level of scalability for extensive systems according to scalability testing results yet multivariate poisson systems show inadequate scalability features. Technical experts confirmed that quantum-resistant cryptographic systems function in reality but organizations require solutions to overcome operational and resource expenditure hurdles. This research creates post-quantum cryptography systems that prove safe and effective through the presentation of algorithm optimization insights and their practical applications framework. The study demonstrates why we need continued development and research to maintain data security because quantum computing will transform in the coming quantum era.
The protection and security of information have always been and continue to be one of the major challenges we face today. Message encryption, digital signatures, financial and banking transactions, and the emerging cryptocurrency market are all threatened by the advancement of quantum computing and its potential ability to break the keys of current algorithms. Cryptographic environments based on public key encryption and digital signatures could be compromised by a sufficiently powerful quantum computer. Over the last decade, state organizations and companies dedicated to information technologies have made significant progress in the development of quantum and postquantum cryptography. This article aims to provide an overview of the advancements and evolution of quantum and post-quantum cryptography algorithms, highlighting their importance in creating secure encryption to mitigate the potential threats posed by quantum computing.