Author:
Tian ChengLiang,Han LiDong,Xu GuangWu
Publisher
Springer Science and Business Media LLC
Reference20 articles.
1. Gauss C F. Disquisitiones Arithmeticae. Leipzig: Gerh Fleischer Iun, 1801
2. Lenstra A K, Lenstra H W, Lovász L. Factoring polynomials with rational coefficients. Math Ann, 1982, 261: 513–534
3. Kannan R. Improved algorithms for integer programming and related lattice problems. In: Proceedings of the 15th Annual ACM Symposium on Theory of Computing. New York: ACM, 1983. 193–206
4. Shamir A. A polynomial time algorithm for breading the basic Merkel-Hellman cryptosystem. In: Proceedings of the 23rd Annual Symposium on Foundations of Computer Science. Washington DC: IEEE, 1982. 145–152
5. Odlyzko A M. The rise and fall of knapsack cryptosystems. In: Pomerance C, ed. Cryptology and Computational Number Theory. Proceedings of Symposia in Applied Mathematics. Boulder: AMS, 1989. 42: 75–88
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献