Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

International Journal of Computer Applications Technology and Research

An Improved Post-Quantum Cryptographic Scheme Based on NTRU

S. Udaya Kumar, Saibal Kumar Pal

Published Jul 10, 2013• 0 citations
Publisher

Abstract

In this paper we report a more secure and efficient encryption algorithm based on the NTRU cryptographic scheme.NTRU is lattice based scheme resistant to quantum computing, hence it falls under the class of post quantum cryptosystems.It is based on shortest vector problem (svp) [9].The main characteristics of the system are low memory and low computational requirements but it provides high level of security.We present modifications in the NTRU scheme for making it more secure and efficient particul arly for applications in wireless and constrained devices.In the original scheme, repetitions in the plaintext message lead to repetitions in the cipher text, which is a source of weakness in the system.To overcome this problem each byte of the input has been digested with different operations that produce different encrypted text even for repeated content of the Plain text message.The second modification is enhancing the public key scheme that makes this system more robust.These two modifications in the NTRU scheme makes it secure even for use in the Quantum Computing environment.

DOI
10.7753/ijcatr0204.1020

Related papers

A Lattice-Based Hybrid Encryption Framework for Post-Quantum Security

Revathy M, D D, Natarajan K

RSA and ECC cryptography methods are classical methods based on the complexity of integer factorization and discrete logarithm problems, but these are in earnest danger due to the rapid advancements in quantum computing. Lattice-based encryption has also emerged as a post-quantum candidate encryption scheme in response to these weaknesses, because of its proven ability to resist quantum attacks. To ensure a safe and efficient transmission of data, the current study provides a lattice-based hybrid encryption model with the combination of two popular post-quantum schemes, NTRU and Kyber. The proposed system provides a powerful two-way key exchange and encryption system, based on a lattice-based key encapsulation mechanism (KEM) introduced by Kyber and the polynomial-based public key encryption introduced by NTRU. To ensure the safety of the exchange of key data, the actual message data is encrypted using a symmetric cipher known as AES (Advanced Encryption Standard), and the exchange of the session key is safely performed with the help of the hybrid NTRU Kyber framework. Using this method, we achieve high computing efficiency, forward secrecy, and resistance to quantum attacks. The project demonstrates the benefits of applying the lattice-based techniques in enhancing the overall security posture of encrypted communications by simulating and executing the techniques. The research results indicate the importance of hybrid post-quantum systems in the development of cryptographic systems that are resistant to novel quantum attacks.

International Conference on Secure Cyber Computing and Communications (ICSCCC)•May 29, 2026•0 citations

The Impact of Quantum Search Algorithms on NTRU Cryptosystem

JunYao, GuihuaZeng, FuchenZhu

Lattice-based cryptosystems rely on certain lattice problems for their socurity, such as the shortest vector and the closest vector probtems. NTRU is a kind of lattice based public key cryptosysytem gaining much attention because of its high efficiency. Its encryption and decryption use a mixing system suggested by polynomial algebra combined with a clustering principle based on elementary probability theory. With the availability of quantum computers, the security of cryptosystems based on classical mathematic problems needs to be reevaluated. Since lattice reduction is the main threat to lattice-based cryptosystems, lattice reduction using quantum search algorithms are analyzed to evaluate the security of NTRU in this paper. According to our results, original security paratneters proposed for NTRU should be increased in the event that Grover's quantum search algorithm is used for lattice reduction.

信息安全与通信保密•Jan 1, 2005•0 citations

Lattice Foundations for Post-Quantum Cryptography: Beyond the RSA Frontier

Revista, Zen, MATH, 10

The advent of large-scale quantum computers poses an existential threat to the security of current public-key cryptosystems, such as RSA and Elliptic Curve Cryptography (ECC), which rely on the computational intractability of integer factorization and discrete logarithms. This paper explores lattice-based cryptography as a promising candidate for post-quantum security. We delve into the mathematical foundations of lattices, specifically focusing on hard problems like the Shortest Vector Problem (SVP), Closest Vector Problem (CVP), Small Integer Solution (SIS), and Learning With Errors (LWE) problems, which are believed to remain intractable even for quantum computers. We provide a comprehensive review of prominent lattice-based constructions, including NTRU, Kyber, and Dilithium, highlighting their security proofs, efficiency considerations, and suitability for various cryptographic primitives such as public-key encryption, key-exchange mechanisms, and digital signatures. Furthermore, we discuss the challenges and opportunities associated with their deployment, including parameter selection, resistance to side-channel attacks, and integration into existing cryptographic infrastructures. By examining the theoretical underpinnings and practical implications, this work aims to solidify understanding of lattice-based methods as a robust and essential component of the cryptographic landscape in the quantum era, moving beyond the traditional RSA frontier.

•Dec 6, 2025•0 citations

Augmenting End-to-End Data Security Using Optimized NTRU Encryption with Quantum-Safe Key Exchange

Geesala Yojana, Talari Surendra, R. Hari Kishore

Cryptographic design and analysis play a key role in securing communication through untrusted channels.This need is even more pronounced with the advent of cloud-centric environments.Symmetric encryption techniques can deliver high computational efficiencies only if the distribution and management of keys are secured.Public key cryptographic systems such as RSA and Elliptic Curve Cryptography (ECC), which have been the mainstay, are at risk due to arrival of quantum computers that can solve the integer factorization and discrete logarithm problems efficiently.Although post-quantum cryptography has made some breakthroughs, the lattice-based schemes still have to contend with difficulties such as heavy computation requirements, difficulty in choosing parameters, high power consumption, and low security-performance tradeoff.If lattices parameters are not properly set, they may not withstand lattice attacks and computational efficiency will also be degraded, limiting factor for their use in cloud environments.This study, in the quest for a solution, recommends the usage of N-th degree Truncated Polynomial Ring Units (NTRU) cryptosystem which is optimized by adjusting key parameters like lattice dimension (N), modulus (q), and small modulus (p) determining a Hermite factor (𝛿)-based approach.A metaheuristic optimization technique, Electric Eel Foraging Optimization (EEFO), is used to effectively balance security strength, correctness, and computational efficiency.Also, a new cryptographically strong and quantum-resistant key exchange capability is provided by the Improved Supersingular Isogeny Diffie-Hellman (ISIDH) protocol.The experiments have shown method to have an encryption strength of 0.95, an average success rate of 93.47%, and reduced energy consumption of 0.00085, thereby proving its efficiency.

International Journal of Computer Networks And Applications•Jun 30, 2026•0 citations

A Lightweight Lattice-Based Post-Quantum Cryptographic Protocol for Secure Key Establishment in Resource-Constrained IoT Edge Devices

Fatima Z. Rahman, Tanvir H. Chowdhury, Anik M. Ahmed

In this work, a lightweight post-quantum cryptographic protocol specifically designed for resource-constrained IoT edge devices is presented, addressing the vulnerability of conventional encryption to quantum computing attacks. The proposed protocol employs a modified NTRU-based algorithm with reduced parameter sizes, achieving switch production in 12.4 ms, encryption in 8.2 ms, and total energy consumption of 4.2 mJ per exchange - 63% lower than standard post-quantum protocols. Experimental results demonstrate resistance against quantum attacks exceeding 1018 processes while maintaining response times under 50 ms, with a compression mechanism reducing message size to 186 bytes. The protocol achieves an optimal balance between post-quantum security and operational efficiency, offering a practical solution for narrow-bandwidth, battery-limited IoT environments.

IRAQI JOURNAL OF MATERIALS•Oct 14, 2026•0 citations

Lattice-Based Cryptography: The Quantum-Resistant Successor to RSA

Revista, Zen, MATH, 10

The advent of quantum computing poses a significant existential threat to the security foundations of current public-key cryptography, most notably the widely adopted RSA algorithm. Shor's algorithm, specifically, can efficiently break the mathematical problems underlying RSA and elliptic curve cryptography, necessitating a paradigm shift towards quantum-resistant solutions. This paper explores lattice-based cryptography as the leading candidate for this post-quantum era. We delve into the fundamental mathematical principles of lattices, including hard problems like the Shortest Vector Problem (SVP), Closest Vector Problem (CVP), Short Integer Solution (SIS), and Learning With Errors (LWE), which form the bedrock of their security. The paper reviews prominent lattice-based schemes such as NTRU, CRYSTALS-Kyber, CRYSTALS-Dilithium, and Falcon, highlighting their construction, security properties, and performance characteristics. We analyze their resilience against both classical and quantum attacks, discuss their progress in the NIST Post-Quantum Cryptography Standardization process, and evaluate their practical implications and implementation challenges. The discussion emphasizes the provable security, versatility, and efficiency of lattice-based methods, positioning them as the robust and essential successor to RSA for safeguarding digital communications and data in a quantum-enabled future.

•Nov 25, 2025•0 citations
In this paper we report a more secure and efficient encryption algorithm based on the NTRU cryptographic scheme.NTRU is lattice based scheme resistant to quantum computing, hence it falls under the class of post quantum cryptosystems.It is based on shortest vector problem (svp) [9].The main characteristics of the system are low memory and low computational requirements but it provides high level of security.We present modifications in the NTRU scheme for making it more secure and efficient particul arly for applications in wireless and constrained devices.In the original scheme, repetitions in the plaintext message lead to repetitions in the cipher text, which is a source of weakness in the system.To overcome this problem each byte of the input has been digested with different operations that produce different encrypted text even for repeated content of the Plain text message.The second modification is enhancing the public key scheme that makes this system more robust.These two modifications in the NTRU scheme makes it secure even for use in the Quantum Computing environment.
RSA and ECC cryptography methods are classical methods based on the complexity of integer factorization and discrete logarithm problems, but these are in earnest danger due to the rapid advancements in quantum computing. Lattice-based encryption has also emerged as a post-quantum candidate encryption scheme in response to these weaknesses, because of its proven ability to resist quantum attacks. To ensure a safe and efficient transmission of data, the current study provides a lattice-based hybrid encryption model with the combination of two popular post-quantum schemes, NTRU and Kyber. The proposed system provides a powerful two-way key exchange and encryption system, based on a lattice-based key encapsulation mechanism (KEM) introduced by Kyber and the polynomial-based public key encryption introduced by NTRU. To ensure the safety of the exchange of key data, the actual message data is encrypted using a symmetric cipher known as AES (Advanced Encryption Standard), and the exchange of the session key is safely performed with the help of the hybrid NTRU Kyber framework. Using this method, we achieve high computing efficiency, forward secrecy, and resistance to quantum attacks. The project demonstrates the benefits of applying the lattice-based techniques in enhancing the overall security posture of encrypted communications by simulating and executing the techniques. The research results indicate the importance of hybrid post-quantum systems in the development of cryptographic systems that are resistant to novel quantum attacks.
Lattice-based cryptosystems rely on certain lattice problems for their socurity, such as the shortest vector and the closest vector probtems. NTRU is a kind of lattice based public key cryptosysytem gaining much attention because of its high efficiency. Its encryption and decryption use a mixing system suggested by polynomial algebra combined with a clustering principle based on elementary probability theory. With the availability of quantum computers, the security of cryptosystems based on classical mathematic problems needs to be reevaluated. Since lattice reduction is the main threat to lattice-based cryptosystems, lattice reduction using quantum search algorithms are analyzed to evaluate the security of NTRU in this paper. According to our results, original security paratneters proposed for NTRU should be increased in the event that Grover's quantum search algorithm is used for lattice reduction.
The advent of large-scale quantum computers poses an existential threat to the security of current public-key cryptosystems, such as RSA and Elliptic Curve Cryptography (ECC), which rely on the computational intractability of integer factorization and discrete logarithms. This paper explores lattice-based cryptography as a promising candidate for post-quantum security. We delve into the mathematical foundations of lattices, specifically focusing on hard problems like the Shortest Vector Problem (SVP), Closest Vector Problem (CVP), Small Integer Solution (SIS), and Learning With Errors (LWE) problems, which are believed to remain intractable even for quantum computers. We provide a comprehensive review of prominent lattice-based constructions, including NTRU, Kyber, and Dilithium, highlighting their security proofs, efficiency considerations, and suitability for various cryptographic primitives such as public-key encryption, key-exchange mechanisms, and digital signatures. Furthermore, we discuss the challenges and opportunities associated with their deployment, including parameter selection, resistance to side-channel attacks, and integration into existing cryptographic infrastructures. By examining the theoretical underpinnings and practical implications, this work aims to solidify understanding of lattice-based methods as a robust and essential component of the cryptographic landscape in the quantum era, moving beyond the traditional RSA frontier.
Cryptographic design and analysis play a key role in securing communication through untrusted channels.This need is even more pronounced with the advent of cloud-centric environments.Symmetric encryption techniques can deliver high computational efficiencies only if the distribution and management of keys are secured.Public key cryptographic systems such as RSA and Elliptic Curve Cryptography (ECC), which have been the mainstay, are at risk due to arrival of quantum computers that can solve the integer factorization and discrete logarithm problems efficiently.Although post-quantum cryptography has made some breakthroughs, the lattice-based schemes still have to contend with difficulties such as heavy computation requirements, difficulty in choosing parameters, high power consumption, and low security-performance tradeoff.If lattices parameters are not properly set, they may not withstand lattice attacks and computational efficiency will also be degraded, limiting factor for their use in cloud environments.This study, in the quest for a solution, recommends the usage of N-th degree Truncated Polynomial Ring Units (NTRU) cryptosystem which is optimized by adjusting key parameters like lattice dimension (N), modulus (q), and small modulus (p) determining a Hermite factor (𝛿)-based approach.A metaheuristic optimization technique, Electric Eel Foraging Optimization (EEFO), is used to effectively balance security strength, correctness, and computational efficiency.Also, a new cryptographically strong and quantum-resistant key exchange capability is provided by the Improved Supersingular Isogeny Diffie-Hellman (ISIDH) protocol.The experiments have shown method to have an encryption strength of 0.95, an average success rate of 93.47%, and reduced energy consumption of 0.00085, thereby proving its efficiency.
In this work, a lightweight post-quantum cryptographic protocol specifically designed for resource-constrained IoT edge devices is presented, addressing the vulnerability of conventional encryption to quantum computing attacks. The proposed protocol employs a modified NTRU-based algorithm with reduced parameter sizes, achieving switch production in 12.4 ms, encryption in 8.2 ms, and total energy consumption of 4.2 mJ per exchange - 63% lower than standard post-quantum protocols. Experimental results demonstrate resistance against quantum attacks exceeding 1018 processes while maintaining response times under 50 ms, with a compression mechanism reducing message size to 186 bytes. The protocol achieves an optimal balance between post-quantum security and operational efficiency, offering a practical solution for narrow-bandwidth, battery-limited IoT environments.
The advent of quantum computing poses a significant existential threat to the security foundations of current public-key cryptography, most notably the widely adopted RSA algorithm. Shor's algorithm, specifically, can efficiently break the mathematical problems underlying RSA and elliptic curve cryptography, necessitating a paradigm shift towards quantum-resistant solutions. This paper explores lattice-based cryptography as the leading candidate for this post-quantum era. We delve into the fundamental mathematical principles of lattices, including hard problems like the Shortest Vector Problem (SVP), Closest Vector Problem (CVP), Short Integer Solution (SIS), and Learning With Errors (LWE), which form the bedrock of their security. The paper reviews prominent lattice-based schemes such as NTRU, CRYSTALS-Kyber, CRYSTALS-Dilithium, and Falcon, highlighting their construction, security properties, and performance characteristics. We analyze their resilience against both classical and quantum attacks, discuss their progress in the NIST Post-Quantum Cryptography Standardization process, and evaluate their practical implications and implementation challenges. The discussion emphasizes the provable security, versatility, and efficiency of lattice-based methods, positioning them as the robust and essential successor to RSA for safeguarding digital communications and data in a quantum-enabled future.