Intractable Problems in Number Theory-Reference-Cited by-同舟云学术

Intractable Problems in Number Theory

Published:1990 Issue: Volume: Page:77-93
ISSN:0302-9743
Container-title:Advances in Cryptology — CRYPTO’ 88
language:
Short-container-title:

Author:

Bach Eric

Publisher

Springer New York

Link

http://link.springer.com/content/pdf/10.1007/0-387-34799-2_7

Reference67 articles.

1. L.M. Adleman, A subexponential algorithm for the discrete logarithm problem with applications to cryptography, in Proceedings of the 1980 IEEE Symposium on Foundations of Computer Science, New York: IEEE (1980).

2. L.M. Adleman and R. McDonnell, An application of higher reciprocity to computational number theory, in Proceedings of the 23rd IEEE Symposium on Foundations of Computer Science, New York: IEEE (1983).

3. L.M. Adleman, C. Pomerance, and R.S. Rumely, On distinguishing prime numbers from composite numbers, Annals of Mathematics 117 (1983), pp. 173–206.

4. * L.M. Adleman and K.S. McCurley, Open problems in number theoretic complexity, in Discrete Algorithms and Complexity (Proceedings of the Japan-US Joint Seminar), London: Academic Press (1987).

5. L.M. Adleman, D.R. Estes, and K.S. McCurley, Solving bivariate quadratic congruences in random polynomial time, Mathematics of Computation 48 (1987), pp. 17–28.

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An authenticated key scheme over elliptic curves for topological networks;Journal of Discrete Mathematical Sciences and Cryptography;2021-05-06

2. The Power of Leibniz-Like Functions as Oracles;Computer Science – Theory and Applications;2020

3. Non-repudiation without public-key;Information Security and Privacy;1996

4. A Comparison of Practical Public-Key Cryptosystems based on Integer Factorization and Discrete Logarithms;Advances in Cryptology-CRYPT0’ 90;1991