Performance analysis of NTRU algorithm with non-post-quantum algorithms

Abstract

In opportunistic networks, the nodes connect to each other wirelessly and use the store-carry-forward technique to transmit the data from one node to another node. The nodes in opportunistic networks are heterogeneous, having high mobility, limited power, low density, short radio range, and numerous security threats to unauthorized nodes. The fundamental challenge in an opportunistic network is to secure and protect the information during communication in networks to achieve the user’s confidence. This issue is technically resolved by incorporating the cryptography algorithms that make both the virtual and modern world in a safer position. Asymmetric Cryptography makes information unintelligible to an unauthorized user and provides confidentiality to genuine users. Encryption and decryption technology are solutions to protect data from unauthorized users. There are many opportunistic network algorithms in the existing literature that provide optimal performance. However, in this research work, we propose the NTRU post-quantum algorithm because of its high performance, low cost, and fast execution during encryption and decryption of the data over the network. We also implemented and analyzed the performance of the proposed NTRU algorithm and compared its results with the Elliptic Curve Cryptography and ElGamal algorithm. After the result analysis, we conclude that our proposed technique is highly effective and secure.

Subject Classification:

• 68M10
• 68M25

Keywords:

• Asymmetric cryptography
• Elliptic curve cryptography
• ElGamal
• NTRU post-quantum
• Security