Post-quantum cryptography is essential for securing digital communications against threats posed by quantum computers. Researchers have focused on developing algorithms that can withstand attacks from both classical and quantum computers, thereby ensuring the security of data transmissions over public networks. A critical component of this security is the key agreement protocol, which allows two parties to establish a shared secret key over an insecure channel. This paper introduces two novel post-quantum key agreement protocols that can be easily implemented on standard computers using rectangular or rank-deficient matrices, exploiting the generalizations of the matrix power function, which is a generator of NP-hard problems. We provide basic concepts and proofs, pseudocodes, and examples, along with a discussion of complexity.
Post-quantum cryptography is essential for securing digital communications against threats posed by quantum computers. Researchers have focused on developing algorithms that can withstand attacks from both classical and quantum computers, thereby ensuring the security of data transmissions over public networks. A critical component of this security is the key agreement protocol, which allows two parties to establish a shared secret key over an insecure channel. This paper introduces two novel post-quantum key agreement protocols that can be easily implemented on standard computers using rectangular or rank-deficient matrices, exploiting the generalizations of the matrix power function, which is a generator of NP-hard problems. We provide basic concepts and proofs, pseudocodes, and examples, along with a discussion of complexity.
Post-quantum cryptography-PQC- aims to develop public-key primitives that are secure against adversaries using classical and quantum computing technologies. This study introduces novel protocols, a key encapsulation mechanism, a digital signature scheme, and special protection against linear attacks. Our purpose is to create reliable alternatives to current standards, seeking compact, fast, and secure replacements of the key interchange and digital signature in the TLS 1_3 protocol, which safeguards Internet traffic, allowing an easy post-quantum transition to protect current data from the harvest now, decrypt later threat.
We present in this paper an algorithm for exchanging session keys, coupled with a hashing encryption module. We show schemes designed for their potential invulnerability to classical and quantum attacks. In turn, if the parameters included were appropriate, brute-force attacks exceed the (five) security levels used in the NIST competition of new post-quantum standards. The original idea consists of products of rectangular matrices in Zp as public values and whose factorization is proved to be an NP-complete problem. We present running times as a function of the explored parameters and their link with operational safety. To our knowledge there are no classical and quantum attacks of polynomial complexity available at hand, remaining only the systematic exploration of the private-key space.
Quantum cryptography has emerged as a revolutionary technology for ensuring secure communication in the era of quantum computing. While existing research primarily focuses on theoretical frameworks and small-scale experimental setups, significant challenges remain in practical implementation, scalability, and security vulnerabilities. This study aims to bridge the gap between theory and real-world deployment by developing robust quantum cryptographic protocols that address key challenges such as noise management, side-channel attacks, and Trojan horse attacks. Additionally, we propose an optimized quantum key distribution (QKD) mechanism that ensures secure communication over long distances under realistic conditions. Our research integrates post-quantum cryptography with quantum cryptographic techniques to provide a hybrid security model that is resilient against both classical and quantum computing threats. By leveraging commercially available quantum hardware and advanced randomness extraction methods, this study contributes to the development of scalable, secure, and efficient quantum communication networks. The findings of this research will play a crucial role in advancing secure digital communication systems and fortifying data security in the post-quantum era.
Quantum cryptography has emerged as a revolutionary technology for ensuring secure communication in the era of quantum computing. While existing research primarily focuses on theoretical frameworks and small-scale experimental setups, significant challenges remain in practical implementation, scalability, and security vulnerabilities. This study aims to bridge the gap between theory and real-world deployment by developing robust quantum cryptographic protocols that address key challenges such as noise management, side-channel attacks, and Trojan horse attacks. Additionally, we propose an optimized quantum key distribution (QKD) mechanism that ensures secure communication over long distances under realistic conditions. Our research integrates post-quantum cryptography with quantum cryptographic techniques to provide a hybrid security model that is resilient against both classical and quantum computing threats. By leveraging commercially available quantum hardware and advanced randomness extraction methods, this study contributes to the development of scalable, secure, and efficient quantum communication networks. The findings of this research will play a crucial role in advancing secure digital communication systems and fortifying data security in the post-quantum era.
Abstract It is viewed as revolutionary technology, offering incredible potential in terms of computing power within different scientific and industrial sectors. Quantum computers provide remarkable computing power; however, they also present significant security risks to existing public-key cryptography systems used to secure digital communication, online banking systems, government, medical applications, cloud computing systems, and IoT systems. Security of commonly used encryption schemes like RSA, DH, and ECC depends on mathematical problems that are impossible for classical computers to solve but can be easily resolved with the help of powerful enough quantum computers by using Shor’s algorithm. Furthermore, Grover’s algorithm makes exhaustive search attacks much faster, thus effectively lowering the security level of symmetric encryption schemes since it provides the speed-up for brute-force attacks. Post-Quantum Cryptography (PQC) turned out to be an effective and scalable method to protect digital data from attacks using quantum computing. In contrast to quantum cryptography, which requires a special quantum communication channel, PQC uses classical cryptographic algorithms that cannot be broken down by either classical or quantum computer due to certain mathematical problems. This research paper offers an extensive exploration of post-quantum cryptography through the analysis of the development of quantum computing, weaknesses of current cryptographic techniques, and mathematics behind quantum-resistant algorithms. Moreover, this paper explores the major classes of PQC techniques such as lattice-based, code-based, hash-based, multivariate, and isogeny-based cryptography and provides details about their security and application. Moreover, the report gives an overview of the NIST Post-Quantum Cryptography Standardization Project and analyzes recent standardizations of quantum-proof algorithms to be utilized in future digital infrastructures. Keywords: Post-Quantum Encryption, Quantum Security, Quantum-Proof Public-Key Cryptography, Lattice-Based Security Protocols, ML-KEM Key Encapsulation Mechanism, ML-DSA Digital Signature Algorithm, NIST Post-Quantum Cryptography, Contemporary Cybersecurity, Secure Communications, Cryptographic Algorithms.
The rapid development of quantum computing poses a threat to traditional public-key systems. The existing Internet security framework relies heavily on public-key cryptography and hash functions, with classical algorithms such as RSA and ECC widely used for digital signatures and identity authentication. Meanwhile, quantum algorithms, represented by Shor’s algorithm and Grover’s algorithm, which can solve the integer factorization and discrete logarithm problems in polynomial time or significantly accelerate brute-force attacks on symmetric ciphers, posing a fundamental threat to traditional public-key cryptographic systems. To address the security threats posed by quantum computing, post-quantum cryptography has emerged. Transition schemes, such as the NIST post-quantum standards, have been proposed; however, new post-quantum algorithms require significantly more computational time for verification than traditional algorithms, and their migration into practical network protocols and blockchain systems presents considerable challenges. Among these, post-quantum digital signature technology is a key branch. This paper systematically reviews research progress in post-quantum digital signatures, summarizes NIST-standardized algorithms and cutting-edge non-standard schemes, and compares the performance of typical algorithms.