Author:
Silverman Joseph H.,Suzuki Joe
Publisher
Springer Berlin Heidelberg
Reference43 articles.
1. Adleman, L., A subexponential algorithm for the discrete logarithm problem with applications to cryptography, Proc. 20th IEEE Found. Comp. Sci. Symp., 1979, pp. 55–60.
2. Lect Notes Comput Sci;L. Adleman,1994
3. A.O. Atkins, The number of points on an elliptic curve modulo a prime, preprint, 1988.
4. R. Balasubramanian and N. Koblitz,, The improbability that an elliptic curve has subexponential discrete log problem under the Menezes-Okamoto-Vanstone algorithm, Journal of Cryptology (to appear).
5. Canfield, E.R., Erdös, P., Pomerance, C., On a problem of Oppenheim concerning ‘Factorisation Numerorum’, Journal Number Theory 17 (1983), 1–28.
Cited by
32 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献