Third International Conference on Information Technology and Applications (ICITA'05) Volume 2 Study on NTRU Decryption Failures Sydney, Australia July 04-July 07 ISBN: 0-7695-2316-1
NTRU [1, 2, etc] is a new public key encryption scheme based on hard problems in lattice. Due to the linear operations, both encryption and decryption of NTRU are very fast [2]. However, decryption of this scheme may be failed even for recommended parameters. In this paper, NTRU decryption failures are analyzed. As a result, the theoretical bound of parameters is presented, which guaranteed NTRU decryption failure free. In order to correct NTRU decryption failures, we designed a compensating algorithm. To our knowledge, this algorithm is better than any other ones for NTRU decryption failure correction. An example is given at the end of this paper.
Index Terms:
NTRU, Decryption Failure, Compensating Algorithm
Citation:
Weichi Yu, Dake He, Shixiong Zhu, "Study on NTRU Decryption Failures," icita, vol. 2, pp.454-459, Third International Conference on Information Technology and Applications (ICITA'05) Volume 2, 2005 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||