Abstract: NTRU is a well-known publi}key cryptosystem based on the difficulty of lattice reduction problems, and is mainly applied in publi}kcy encryption and digital signature. This paper constructed a non-interactive and non-malleable commitment scheme, which relies the security on the intractable CVP on lattice, and the binding property of commuter is satisfied. The validity of commitment is verified by hash function's collision resistance. Perturbing the plaintext with randomized mapping,plaintext will be in random distribution, and this scheme satisfies the hiding property of verifier and is non-malleable with respect to decommitment} This scheme has high efficiency as well as NTRU, and can resist channel eavesdropping attack, message replay attack and copying commitment attack.

Key words: Public key cryptography, NTRU, Lattice, Commitment