A ECC-based key distribution protocol for SIP environment is proposed by Arshad et al. However, traditional public key cryptosystems such as ECC and RSA is vulnerable to quantum computing attacks. In this paper, to resolve theses security weakness, we propose a key distribution protocol using the NTRU of lattice-based cryptosystem. Our proposed scheme is applied to quantum environment efficiently.
A ECC-based key distribution protocol for SIP environment is proposed by Arshad et al. However, traditional public key cryptosystems such as ECC and RSA is vulnerable to quantum computing attacks. In this paper, to resolve theses security weakness, we propose a key distribution protocol using the NTRU of lattice-based cryptosystem. Our proposed scheme is applied to quantum environment efficiently.
In order to build a secure and an efficient scheme even in the presence of quantum computers, we propose an improved authenticated key agreement scheme based on NTRU for applications in e-health platforms. In fact, user authentication and key agreement are important cryptographic primitives that allow two entities to establish a secure and an authenticated channel over insecure networks. Currently, the security of the most of these primitives relies on RSA or ECC standards, which ensure high security levels. Unfortunately, all cryptosystems based on factorization problems (e.g., RSA) or the discrete logarithm problem in finite groups (e.g., ECC) will be vulnerable to quantum attacks in the next few years due to Shor’s algorithm. Security and efficiency analysis show that the proposed scheme can resist various attacks, including quantum attacks while preserving efficiency.
A quantum computer is a paradigm of information processing that can show remarkable possibilities of exponentially improved information processing. However, this paradigm could disrupt the current cryptosystem, which is called quantum computing attacks, by calculating factoring problem and discrete logarithm problem. Recently, NTRU is applied to various security systems, because it provides security against to provide secu-rity against quantum computing attacks. Furthermore, NTRU provides similar security level and efficient computation time of encryption/decryption compared to traditional PKC. In 2018, Jeong et al. proposed an user authentication and key distribution scheme using NTRU. They claimed that their scheme provides various security properties and secure against quantum comput-ing attacks. In this paper, we demonstrate that their scheme has security pitfalls and incorrectness in login and authentication phase. We also suggest countermeasures to fix the incorrectness and provide security against various attacks.
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.
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.
Authentication has been adopted in many areas, but most of these authentication schemes are built using traditional cryptographic primitives. It is widely believed that such primitives are not resistant to quantum algorithms. To deal with those quantum attacks, lattice-based cryptography was introduced by Ajtai in 1996. To the best of our knowledge, the existing lattice-based authentication schemes are based on a lattice-based public key encryption called NTRU: a ring-based public key cryptosystem, proposed by Hoffstein, Pipher, and Silverman in 1998. However, these schemes only support the case of a single user. In view of the aforementioned issue, we propose the first lattice-based group authentication scheme. The proposed scheme is secure against replay attacks and man-in-the-middle attacks. Moreover, compared with the existing lattice-based authentication schemes, ours provides the most efficient method to agree upon a session key among a group of users after mutual authentication.
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.