2Shor P W. Algorithms for quantum computation: discrete logarithms and factoring[C]//35th Annual Symposium on Foundations of Computer Science, 1994:124-134.
3Vandersypen L M K, Steffen M, Breyta G, eta Experimenta realization of Shor's quantum factoring algorithm using nuclear magnetic resonance[J].Nature 2001,414(6866), 883-887.
4Micciancio. The short vector problem is NP-hard to approximate to within some constant[J].SIAM Journal on Computing,2007,30 (6): 2008-2035.
5Micciancio D, Goldwasser S. Complexity of lattice problem[M].Kluwer Academic Publishers,2002.
6Garey M R, Johnson D.S. Computer and Intractability-A Guide to the Theory of NP-Completeness[M].Appendix A7.2 W H Freeman and Company,1979.
7Craig Gentry.Toward Basing Fully Homomorphic Encryption on Worst-Case Hardness[EB/OL].http://www. iacr.org/conferences/crypto2010/accepted.html.
