2Daniele Micciancio.Lattice Based Cryptography:A Global Improvement,1999.
3Schnorr C P.A hierarchy of polynomial time lattice basis reduction algorithms.Theoretical Computer Science,1987,53:201 ～224.
4Jacobson N,Basic Algebra I.Second Edition.Freeman W H and Company,1985.
5Goldreich O,Goldwasser S,Halevy S.Public-key cryptography from lattice reduction problems.In:Proc.CRYPTO'97,1997,volume 1294 of LNCS:112～131.
6Goldreich O,Goldwasser S,Halevi S.Challenges for the GGHCryptosystem.Available at:http://theory.lcs.mit.edu/～shaih/challenge.html.
7Gentry C,Jonsson J,Stern J,et al.Cryptanalysis of the NTRU Signature Scheme (NSS).Eurocrypt' 01,Lecture Notes in Computer Science,Springer-Verlag,2001.
8Dinur I,Kindler G,Ssfra S.Approximation CVP to within almostpolynomial factors is NP-hard.39th Annual Symposium on Foundations of Computer Sicence,Palo Alto,California,1998.
9Goldreich O,Micciancio D,Safra S,et al.Approximating shortest lattice vectors is not harder than approximating closest lattice vectors:[technical reports].Electronic Colloquium on Computational Complexity,ECCC,1999.
10Krawczyk H,Rabin T. Chameleon signatures[A].2000.143-154.
