Efficient Implementations of NTRU in Wireless Network


NTRU is a lattice-based public key cryptosystem featuring reasonably short, easily created keys, high speed, and low memory requirements, seems viable for wireless network. This paper presents two optimized designs based on the enhanced NTRU algorithm. One is a light-weight and fast NTRU core, it performs encryption only. This work has a gate-count of 1175 gates and a power consumption of 1.51 μW. It can finish the whole encryption process in 1498 μs at 500 kHz. As such, it is perfect for wireless sensor network. Another high-speed NTRU core is capable of both encryption and decryption, with delays of 16,064 μs and 128,010 μs in encryption and decryption respectively. Moreover, it consists of 25,758 equivalent gates and has a total power consumption of 59.2 μW (it will be reduced greatly if low power methods were adopted). This core is recommended to be used in base stations or servers in wireless network.


Share and Cite:

Zhan, X. , Zhang, R. , Xiong, Z. , Zheng, Z. and Liu, Z. (2013) Efficient Implementations of NTRU in Wireless Network. Communications and Network, 5, 485-492. doi: 10.4236/cn.2013.53B2089.

Conflicts of Interest

The authors declare no conflicts of interest.


[1] G. Gaubatz, J. P. Kaps and B. Sunar, “Public Key Cryptography in Sensor Networks—Revisited,” 1st European Workshop on Security in Ad-Hoc and Sensor Networks, 2005, pp. 2-18
[2] J. Hoffstein, J. Pipher and J. H. Sil-verman, “NTRU: A Ring-Base Public Key Cryptosystem,” In: J. P. Buhler, Ed., Algorithmic Number Theory (ANTS III), Lecture Notes in Computer Science, Springer-Verlag, Berlin, 1998, pp. 267-288,.
[3] C. M. O’Rourke, “Efficient NTRU Implementations,” Master Thesis, Worcester Polytechnic Institute, Worcester, 2002.
[4] J. Kaps, “Cryptography for Ultra-Low Power Devices,” Ph.D. Thesis, Worcester Polytechnic Institute, Worcester, 2006.
[5] A. C. Atici, L. Batina, J. Fan, I. Verbauwhede and S. B. O. Yalcin, “Low-Cost Implementations of NTRU for Pervasive Security,” International Conference on Application-Specific Systems, Architectures and Processors, 2008. pp. 79-84.
[6] J. Hoffstein and J. Silverman, “Optimizations for NTRU,” Public-Key Cryptography and Computational Number Theory: Proceedings of the International Conference organized by the Stefan Banach International Mathematical Center Warsaw, Poland, September 11-15, 2000, p. 77.
[7] J. Hoffstein and J. H. Silverman, “Random Small Hamming Weight Products with Applications to Cryptography,” Discrete Applied Mathematics, Vol. 130, No. 1, 2003, pp. 37-49.
[8] J. H. Silverman and W. Whyte, “Estimating Decryption Failure Probabilities for NTRUencrypt,” Technical Report, NTRU Cryptosystems, 2005, Technical Report No. 18, Version 1.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.