| Enhanced NTRU cryptosystem eliminating decryption failures |
| |
| 作者姓名： | Yao Jun & Zeng Guihua Dept. of Electronic Engineering Shanghai Jiaotong Univ. Shanghai P.R.China |
| |
| 作者单位： | Yao Jun & Zeng Guihua Dept. of Electronic Engineering，Shanghai Jiaotong Univ.，Shanghai 200030，P.R.China |
| |
| 摘 要： | 1. INTRODUCTION In 1996, Hoffstein, Pipher and Silverman presented a public key cryptosystem based on polynomial algebra called NTRU 1]. The security of NTRU is based on the hardness of some lattice problems, namely the shortest and the closest vector problems. It is one of the fastest public key encryption schemes known. Because the encryption and decryption process of this system involves polynomials with small coefficients, it is quite fast compared to systems like RSA, El Gamal…
|
| 收稿时间： | 9 May 2005. |
Enhanced NTRU cryptosystem eliminating decryption failures |
| |
| Yao Jun & Zeng Guihua Dept. of Electronic Engineering,Shanghai Jiaotong Univ.,Shanghai ,P.R.China.Enhanced NTRU cryptosystem eliminating decryption failures[J].Journal of Systems Engineering and Electronics,2006,17(4):890-895. |
| |
| Authors: | Yao Jun Zeng Guihua |
| |
| Institution: | Dept. of Electronic Engineering, Shanghai Jiaotong Univ., Shanghai 200030, P.R.China |
| |
| Abstract: | An enhaned NTRU cryptosystem eliminating decryption failures is proposed without using padding schemes and can resist the oracle model andchosen-ciphertext attacks. Because lattice reduction is the main threat to lattice-based cryptosystems, lattice reductionalgorithms are analyzed to evaluate the security of this scheme. Furthermore, the new scheme remains the advantage of high efficiency of original NTRU. |
| |
| Keywords: | NTRU cryptosystem polynomial algebra decryption failure lattice reduction |
| 本文献已被 CNKI 万方数据 ScienceDirect 等数据库收录！ |
