1Ajtai M. Generating hard instances of lattice problems (extended abstract) [C]. Proceedings of the twenty-eighth annual ACM symposium on Theory of computing, Philadelphia, Pennsylvania, USA, 1996. Philadelphia, Pennsylvania, USA: ACM, 1996: 99-108. 被引量：1
2Goldwasser S. New directions in cryptography: twenty some years later (or cryptograpy and complexity theory: a match made in heaven)[C]. Foundations of Computer Science, 1997. Proceedings., 38th Annual Symposium on, Miami Beach, FL, 1997. Miami Beach, FL: 1997: 314-324. 被引量：1
3Rivest R L, Shamir A, Adleman L. A method for obtaining digital signatures and public-key cryptosystems[J]. Commun. ACM. 1978, 21(2): 120-126. 被引量：1
4Van Erode Boas P. Another NP-complete problem and the complexity of computing short vectors in a lattice[R]. Technical report 81-04,Math Inst.,University of Amsterdam,Amsterdam, 1981. 被引量：1
5Cai J Y N. Approximating the SVP to within a factor (1-1/dime) is NP-hard under randomized reductions.Journal of Computer and System Sciences,vol.S9(2),p221-239[J]. 1999. 被引量：1
6Mikl, Ajtai S. Generating Hard Instances of the Short Basis Problem[C1. Proceedings of the 26th International Colloquium on Automata, Languages and Programming, 1999. Springer-Verlag, 1999:1-9. 被引量：1
