In the evolving landscape of quantum computing, the security of conventional cryptosystems is increas- ingly compromised. This requires innovative data protection strategies, leading to the exploration of Post-Quantum Cryptography (PQC) techniques. This research aims to address these challenges, focusing on the integration of Nth- Degree Truncated Polynomial Ring (NTRU) encryption - known for its quantum resistivity - and Shamir’s Secret Sharing (SSS) for secure and quantum-secured key distribution, particularly in resource-constrained environments. Despite their effectiveness, NTRU ciphers face obstacles in public key distribution due to significant computational and memory requirements. Leveraging SSS, a scheme to distribute the NTRU public key to multiple shares, providing enhanced security while mitigating resource limitations is proposed. Recognizing the potential for security breaches like Man-in-the-Middle (MitM) and Distributed Denial of Service (DDoS) attacks, the proposed work seeks to fortify defenses against these threats. The findings of the proposed method are intended to offer a significant contribution to strengthening cryptographic practices in the face of emerging quantum technologies.
In the evolving landscape of quantum computing, the security of conventional cryptosystems is increas- ingly compromised. This requires innovative data protection strategies, leading to the exploration of Post-Quantum Cryptography (PQC) techniques. This research aims to address these challenges, focusing on the integration of Nth- Degree Truncated Polynomial Ring (NTRU) encryption - known for its quantum resistivity - and Shamir’s Secret Sharing (SSS) for secure and quantum-secured key distribution, particularly in resource-constrained environments. Despite their effectiveness, NTRU ciphers face obstacles in public key distribution due to significant computational and memory requirements. Leveraging SSS, a scheme to distribute the NTRU public key to multiple shares, providing enhanced security while mitigating resource limitations is proposed. Recognizing the potential for security breaches like Man-in-the-Middle (MitM) and Distributed Denial of Service (DDoS) attacks, the proposed work seeks to fortify defenses against these threats. The findings of the proposed method are intended to offer a significant contribution to strengthening cryptographic practices in the face of emerging quantum technologies.
The emergence of quantum computing is a serious threat to the principles of modern crypto-logical mathematics. The classical public-key cryptography, including Rivest-Shamir-Adleman (RSA), Elliptic Curve Cryptography (ECC), and Diffie-Hellman are very safe against classical adversaries yet become susceptible to quantum algorithms, including the Shor algorithm, which can easily solve the underlying mathematical problems. This weakness is jeopardizing confidentiality and integrity of the world-wide systems of communication, money transactions, and essential structures, and requires the immediate creation of safe alternatives. The current literature on post-quantum cryptography (PQC) has covered various classes of algorithm, such as lattice-based, code-based, multivariate schemes, and isogeny-based schemes. Although lattice-based approaches like Nth Degree Truncated Polynomial Ring Unit (NTRU) and FrodoKEM can be highly theoretically resistant, they can be computationally and memory-intensive. Cryptosystems based on code such as Classic McEliece are secure but not practicable because they have huge public key sizes. Multivariate schemes like Rainbow, and isogeny-based schemes like Super singular Isogeny Key Encapsulation (SIKE) have been attacked recently by cryptanalytic attacks, and broken completely. Such restrictions open the necessity to find more efficient and secure quantum-resistant solutions.This research study postulates a hybrid post-quantum cryptographic (PQC) system that combines CRYSTALS-Kyber for encryption with CRYSTALS-Dilithium for digital signatures both of which are approved through the National Institute of Standards and Technology (NIST) PQC standardization program. The model will be such that it ensures quantum resistance but at the same time it will be scalable, efficient and compatible with the existing infrastructures. The test outcomes indicate that the hybrid PQC model is 35-45 percent faster to encrypt and decrypt, signature performance is enhanced by up to 40 percent, and the throughput is 20 times higher (98.7 Mbps) than the same base PQC scheme including Nth Degree Truncated Polynomial Ring Unit (NTRU), McEliece and Rainbow. These enhancements affirm that the suggested model provides a viable trade-off between the security, speed, and efficiency in terms of key size, which makes it a viable and a sound base to ensure secure communication in the quantum age.
With the rapid advancement regarding quantum computing, traditional cryptographic systems face an existential threat because of their reliance concerning mathematical challenges which may be addressed effectively solved using quantum algorithms like the one developed by Shor. This imminent risk has driven extensive research into quantum-resistant cryptography (PQC), that seeks to develop encryption methods resilient against attacks powered by quantum computing. This study offers a thorough literature survey on high-level security techniques in quantum security for PQC, analysing past and current research efforts in this domain. We first examine the vulnerabilities of classical cryptographic protocols, including public-key encryption methods such as RSA (developed by Rivest, Shamir, and Adleman) and ECC (which uses elliptic curve mathematics), and traditional cryptographic hashing methods, against quantum adversaries. The study then explores the foundational approaches to quantum-secure cryptography, including lattice-based, hash-based, multivariate polynomial, code-based, and isogeny-based encryption methods that possess emerged as promising candidates for standardization. The survey highlights key challenges in the real-world application of PQC, including performance trade-offs, key size overhead, and deployment complexities. We conclude by identifying future research directions during the creation of scalable, efficient, and provably secure cryptographic methods designed to withstand quantum attacks techniques. As the shift toward the quantum-resilient era approaches, this survey aims to provide a clear and structured comprehension of the evolving the domain of quantum security for PQC.
Most of the current public key cryptosystems’ security is based on the integer factorization and the discrete logarithm, which are mathematical problems that are considered difficult to solve. However, the publication in 1994 of the Shor’s algorithm [1] was a major setback for the world of cryptography, since it provided a quantum algorithm capable of solving efficiently these mathematical problems. Therefore, in recent years many governments and technology companies have put a lot of effort into developing what is known as post-quantum cryptography, i.e. the science that studies cryptosystems that are resistant to quantum attacks. Along these lines, in 2016 the National Institute of Standards & Technology launched a competition with the aim of establishing and standardising the best performing post-quantum cryptosystems, being the NTRU (Nth Degree Truncated polynomial Ring Units) cryptosystem one of the candidates still on the table. The aim of this project is to study the quantum-resistant cryptosystem NTRU, both from a theoretical and practical point of view. Firstly, the mathematical results on which it is based are presented and the existing attacks against it are analyzed. Finally, a practical implementation of the cryptosystem and four of its attack is carried out, from which experimental results are extracted.
The potential of quantum computing to compromise traditional public-key cryptography (PKC) has led to a pressing need for more efficient and resilient cryptographic methods. Recent advancements, such as the 800x improvement in the logical error rate by Microsoft and QUANTINUUM, underscore the urgency of this issue. Post-quantum cryptography (PQC) offers a promising solution designed to withstand quantum attacks. This paper examines how PQC and other advanced cryptographic techniques can enhance the security and efficiency of PKC in the quantum era. Current PKC methods, despite revolutionizing secure online communication, are vulnerable to flaws in their underlying algorithms. The proposed hybrid model integrates PQC with traditional PKC, leveraging both technologies' strengths to mitigate quantum threats while preserving established security benefits. The investigation addresses critical research questions: how to enhance PKC key management for better efficiency and security, and which PQC techniques can protect PKC from quantum attacks. This paper's contribution includes identifying vulnerabilities in existing PKC, comparing RSA and post-quantum algorithms, and implementing a PQC algorithm between a client and server to analyze integration with existing protocols. Finally, the paper recommends security mechanisms to improve PQC protocols, ensuring robust protection against emerging quantum computing capabilities.
Current improvements in quantum computing present a substantial challenge to classical cryptographic systems, which typically rely on problems that can be solved in polynomial time using quantum algorithms. Consequently, post-quantum cryptography (PQC) has emerged as a promising solution to emerging quantum-based cryptographic challenges. The greatest threat is public-key cryptosystems, which are primarily responsible for key exchanges. In PQC, key encapsulation mechanisms (KEMs) are crucial for securing key exchange protocols, particularly in Internet communication, virtual private networks (VPNs), and secure messaging applications. CRYSTALS-Kyber and NTRU are two well-known PQC KEMs offering robust security in the quantum world. However, even when quantum computers are functional, they are not easily accessible. IoT devices will not be able to utilize them directly, so there will still be a requirement to protect IoT devices from quantum attacks. Concerns such as limited computational power, energy efficiency, and memory constraints in devices such as those used in IoTs, embedded systems, and smart cards limit the use of these techniques in constrained environments. These concerns always arise there. To address this issue, this study conducts a broad comparative analysis of Kyber and NTRU, with special focus on their security, performance, and implementation efficiency in such environments (IOT/constrained environments). In addition, a case study was conducted by applying KEMs to a low-power embedded device to analyze their performance in real-world scenarios. These results offer an important comparison for cyber security engineers and cryptographers who are involved in integrating post-quantum cryptography into resource-constrained devices.
In the medical field, images play a crucial role in patient monitoring, treatment planning, and diagnosis. Since the digital healthcare revolution, a large number of medical images are being transmitted and stored, making security essential. Any breach in data confidentiality can lead to misdiagnosis of patients. The traditional encryption techniques, like McEliece, have been used to shield medical data. However, the rise of quantum computers poses a threat to the prevailing encryption techniques, as they can easily break and expose medical data to quantum attacks. To overcome these attacks, post-quantum cryptography (PQC) has been introduced. Nth degree truncated polynomial ring unit (NTRU) is a lattice-based PQC algorithm that uses complex mathematical concepts that cannot be solved by quantum computers. Harnessing NTRU's lattice-based security ensures the robustness and resilience of medical data. The proposed system implements the PQC-based NTRU algorithm to protect medical data against quantum attacks.