Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference27 articles.
1. E.F. Brickell, “Solving low density knapsacks,” in:Advances in Cryptology, Proceedings of CRYPTO'83 (Plenum Press, New York, 1984) pp. 25–37.
2. B. Chor and R. Rivest, “A knapsack-type public key cryptosystem based on arithmetic in finite fields,”IEEE Transactions on Information Theory IT-34 (1988) 901–909.
3. M.J. Coster, A. Joux, B.A. La Macchia, A.M. Odlyzko, C.P. Schnorr and J. Stern, “An improved lowdensity subset sum algorithm,”Computational Complexity 2 (1992) 97–186.
4. P. van Emde Boas, Another NP-complete partition problem and the complexity of computing short vectors in a lattice, Rept. 81-04, Dept. of Mathematics, Univ. of Amsterdam, 1981.
5. M. Euchner, Praktische Algorithmen zur Gitterreduktion und Faktorisierung, Diplomarbeit Uni. Frankfurt (1991).
Cited by
736 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献