Welcome to Journal of University of Chinese Academy of Sciences,Today is

›› 2011, Vol. 28 ›› Issue (6): 832-836.DOI: 10.7523/j.issn.2095-6134.2011.6.019

• Research Articles • Previous Articles    

Simple proof of bit security for NTRU

ZHAO Yong-Bin, FAN Tong-Rang   

  1. Shijiazhuang Tiedao University, Shijiazhuang 050043, China
  • Received:2010-06-14 Revised:2010-09-03 Online:2011-11-15

Abstract:

Based on the malleability, the bit security for NTRU is proved in a simplified decision model. In the model, the oracle can obtain the goal plain text through a sequence of queries if the oracle can output the parity of summation of coefficients in the goal plain text. Compared to the work of Mats, the model is simple and consistent with the decryption process of NTRU. Finally, the relationship between bit security and indistinguishability of encryption scheme is analyzed and the result shows that the formal definition of strong security is of great practicability.

Key words: public key cryptography, bit security, NTRU, malleability, oracle

CLC Number: