Logical Mistakes in NTRU Compensation Algorithm and Improvement of Encryption Verification Algorithm

Author

Quan, Yining ; Li, Xinshe ; Hu, Yupu

Author_Institution

XiDian Univ., Xi´´an

fYear

2007

fDate

15-19 Dec. 2007

Firstpage

769

Lastpage

772

Abstract

The basic security of NTRU is based on the hardness of the shortest vector problem (SVP) of some lattice, named as CS lattice. Dealing with the decryption failure problem of NTRU is an important topic. The logical mistakes and defects of NTRU compensation algorithm which is used for dealing with the decryption failure problem of NTRU are analyzed. The compensation algorithm is proven to be incorrect in this paper. It seems that NTRU encryption verification algorithm can cope with the decryption failure problem of NTRU. But in fact, it is hard to get a satisfying result. An improvement scheme on NTRU encryption verification algorithm is also put forward and discussed, which can correctly resume the plaintext in high probability while the security is the same with NTRU.

Keywords

public key cryptography; CS lattice; NTRU compensation algorithm; decryption failure problem; encryption verification algorithm; shortest vector problem; Algorithm design and analysis; Computational intelligence; Computer networks; Computer security; Information security; Laboratories; Lattices; Polynomials; Public key cryptography; Wrapping;

fLanguage

English

Publisher

ieee

Conference_Titel

Computational Intelligence and Security Workshops, 2007. CISW 2007. International Conference on

Conference_Location

Harbin

Print_ISBN

978-0-7695-3073-4

Type

conf

DOI

10.1109/CISW.2007.4425608

Filename

4425608