Author:
Espinosa García J.,Hernández Encinas L.,Muñoz Masqué J.
Publisher
Springer Science and Business Media LLC
Reference76 articles.
1. Adleman, L.: A subexponential algorithm for discrete logarithm problem with applications to cryptography. In: Proc. 20th IEEE Found. Comp. Sci. Symp., pp. 55–60 (1979)
2. Adleman, L., DeMarrais, J.: A subexponential algorithm for discrete logarithms over all finite fields. Math. Comp. 61, 1–15 (1993)
3. Adleman, L., DeMarrais, J., Huang, M.: A subexponential algorithm for discrete logarithms over the rational subgroup of the Jacobians of large genus hyperelliptic curves over finite fields. In: Proc. of Algorithmic Number Theory, LNCS, vol. 877, pp. 28–40 (1994)
4. Adleman, L., Huang, M.: Primality testing and abelian varieties over finite fields. In: LNM 1512. Springer, Berlin Heidelberg New York (1992)
5. American National Standards Institute: Public key cryptography for the financial services industry: The elliptic curve digital signature algoritm (ECDSA), ANSI X9.62-1998.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献