Author:
Koyama Kenji,Maurer Ueli M.,Okamoto Tatsuaki,Vanstone Scott A.
Publisher
Springer Berlin Heidelberg
Reference25 articles.
1. L. Adleman, K. Manders, and G. Miller, “On taking roots in finite fields”, 20th FOCS, Vol. 20, 1977, pp.175–178 (1977).
2. D. Chaum, “Blind signatures for untraceable payments”, Proc. of Crypto’82, pp.199–203 (1982).
3. W. Diffie and M.E. Hellman, “New directions in cryptography, IEEE Transactions on Information Theory,” Vol. 22, No. 6, pp. 644–654 (1976).
4. T. El-Gamal, “A public key cryptosystem and a signature scheme based on the discrete logarithm”, IEEE Transactions on Information Theory, Vol. 31, No. 4, pp. 469–472 (1985).
5. S. Goldwasser and J. Kilian, “Almost all primes can be quickly certified”, Proc. of the 18th Annual ACM Symposium on the Theory of Computing, pp. 316–329 (1986).
Cited by
59 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献