This article presents the NTRU (N-th degree Truncated Polynomial Ring) encryption algorithm and extends the encryption and decryption processes using polynomials. The operation of the encryption and decryption algorithms is carried out by generating random polynomials and converting messages into polynomials. The article discusses the quantum-resistant properties of the NTRU algorithm and how it differs from the classical RSA or elliptic curve algorithms. The importance of the NTRU algorithm and its stability against quantum algorithms for ensuring cryptographic security in the post-quantum era are emphasized. These approaches show the possibilities of countering the threats that arise, especially behind the development of quantum computers. The program shows how encryption works in the Python programming language and using polynomials.
This article presents the NTRU (N-th degree Truncated Polynomial Ring) encryption algorithm and extends the encryption and decryption processes using polynomials. The operation of the encryption and decryption algorithms is carried out by generating random polynomials and converting messages into polynomials. The article discusses the quantum-resistant properties of the NTRU algorithm and how it differs from the classical RSA or elliptic curve algorithms. The importance of the NTRU algorithm and its stability against quantum algorithms for ensuring cryptographic security in the post-quantum era are emphasized. These approaches show the possibilities of countering the threats that arise, especially behind the development of quantum computers. The program shows how encryption works in the Python programming language and using polynomials.
With the current increase in the rate of quantum computing, traditional cryptographic algorithms face a significant risk of compromise, as they are based on mathematical problems that quantum algorithms can efficiently solve. One solution to this challenge has come up in the form of post-quantum cryptography (PQC). By having a hybrid encrypted solution that combines the two different encryption algorithms, NTRU quantum-resistant and fast AES symmetric-key, with a well-integrated combination presented in this paper, we aim to usher in secure and safe data in the post-quantum era. This mixed regime is the most advanced approach that combines classical and quantum encryption. We compare the performance of the system with that of standalone AES, NTRU, and RSA-based systems, examining aspects such as encryption, decryption, key generation, and key size. Benchmarks indicate that the hybrid system has an overhead, but its performance is passable; encryption times are 60ms and 14000ms for 1 KB and 5000 KB of data, respectively, compared to 12ms for 1 KB and 50ms for 5000 KB by AES and NTRU. The same can be said about decryption, with the hybrid system being more efficient than NTRU but still slower than AES. The NTRU key generation times were depicted as unfavorable compared to those of AES, and this margin was seen to increase as the key sizes of NTRU were varied. Compared to executing the same algorithm on a classical computer, the hybrid system is relatively computationally expensive but offers strong quantum resistance. A hybrid encryption system based on the AES-NTRU is a solution to the quantum computing threat to data security. Later projects will be based around various efforts to optimize the NTRU system, also including hardware acceleration opportunities and an increase in the system utilization in real-life environments.
The quantum-resistant qualities of various encryption methods, such as N-th degree Truncated polynomial Ring Units (NTRU) Encrypt, NTRU Sign, Ring-Lizard, and Kyber protocols are becoming more important in light of the ever-evolving nature of digital threats. An-depth analysis of the mathematical derivation of these algorithms, as well as a determination of their computing efficiency and resistance to quantum assaults is discussed in this paper. Techniques of the Ring-Lizard and Kyber algorithms to lattice-based encryption are analyzed. The study gives an overview of quantum-resistant capabilities of these algorithms and their performance measures. Strengths and weaknesses of the NTRU Encrypt, NTRU Sign, Ring-Lizard, and Kyber algorithms are discussed. The results give useful insights for cybersecurity practitioners, academics, and policymakers, aiding them in making educated choices to protect digital infrastructures against quantum attacks.
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.
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.
Abstract Data security in the cloud has been a major issue since the inception and adoption of cloud computing. Various frameworks have been proposed, and yet data breach prevails. With encryption being the dominant method of cloud data security, the advent of quantum computing implies an urgent need to proffer a model that will provide adequate data security for both classical and quantum computing. Thus, most cryptosystems will be rendered susceptible and obsolete, though some cryptosystems will stand the test of quantum computing. The article proposes a model that comprises the application of a variant of McEliece cryptosystem, which has been tipped to replace Rivest–Shamir–Adleman (RSA) in the quantum computing era to secure access control data and the application of a variant of N-th degree truncated polynomial ring units (NTRU) cryptosystem to secure cloud user data. The simulation of the proposed McEliece algorithm showed that the algorithm has a better time complexity than the existing McEliece cryptosystem. Furthermore, the novel tweaking of parameters S and P further improves the security of the proposed algorithms. More so, the simulation of the proposed NTRU algorithm revealed that the existing NTRU cryptosystem had a superior time complexity when juxtaposed with the proposed NTRU cryptosystem.