Author:
Blake Ian F.,Gao XuHong,Mullin Ronald C.,Vanstone Scott A.,Yaghoobian Tomik
Reference38 articles.
1. L. Adleman, “A subexponential algorithm for the discrete logarithm problem with applications to cryptography”, 20th Annual Symposium on Foundations of Computer Science (1979), 55–60.
2. E. Bach, “Discrete logarithms and factoring”, Technical Report No. UCB/CSD 84/186, Computer Science Division (Eecs), University of California, Berkeley, California, June 1984.
3. T. Beth, “Efficient zero-knowledge identification scheme for smart cards”, Advances in Cryptology: Proceedings of Eurocrypt ‘88, Lecture Notes in Computer Science, 330 (1988), Springer-Verlag, 77–84.
4. I. Blake, R. Fuji-Hara, R. Mullin and S. Vanstone, “Computing logarithms in finite fields of characteristic two”, SIAM J. Alg. Disc. Math., 5 (1984), 276–285.
5. M. Blum and S. Micali, “How to generate cryptographically strong sequences of pseudo-rAndom bits”, SIAM J. Comput., 13 (1984), 850–864.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献