Publisher
Springer Berlin Heidelberg
Reference12 articles.
1. E. R. Berlekamp, R. J. Mc Eliece and H. C. A. Van Tilborg. On the inherent intractability of certain coding problems, IEEE Trans. Inform. Theory, (1978) 384–386.
2. Lect Notes Comput Sci;F. Chabaud,1992
3. M. J. Coster, A. Joux, B. A. LaMacchia, A. M. Odlyzko, C. P. Schnorr and J. Stern, Improved low-density subset sum algorithms, Computational Complexity, to appear.
4. Lect Notes Comput Sci;A. Fiat,1986
5. U. Feige, A. Fiat and A. Shamir, Zero-knowledge proofs of identity, Proc, 19th ACM Symp. Theory of Computing, 210–217, (1987) and J. Cryptology, 1 (1988), 77–95.
Cited by
161 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献