L. Adleman, A subexponential algorithm for the discrete logarithm problem with application to cryptography, Proceedings IEEE 20th annual symposium on foundations of computer science, 1979, pp. 55--60. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
A New Key Exchange Primitive Based on the Triple.. - Yesem Kurt October (Correct)
No context found.
L. Adleman, A subexponential algorithm for the discrete logarithm problem with application to cryptography, Proceedings IEEE 20th annual symposium on foundations of computer science, 1979, pp. 55--60.
An Ecient Anonymous Group Identification Scheme - With Short Secret (Correct)
No context found.
Adleman, L. A subexponential algorithm for the discrete logarithm problem with applications to cryptography. In IEEE FOCS (1979), pp. 55--60.
Elliptic Curve DSA (ECDSA): An Enhanced DSA - Don Johnson Certicom (Correct)
No context found.
L. Adleman, J. DeMarrais and M. Huang, "A subexponential algorithm for discrete logarithms over the rational subgroup of the jacobians of large genus hyperelliptic curves over finite fields", Algorithmic Number Theory, Lec- ture Notes in Computer Science, 877 (1994), Springer-Verlag, 28-40.
An approach to create coprime polynomial pairs.. - Stmicroelectronics .. (Correct)
No context found.
Leonard M. Adleman and Jonathan DeMarrais, A subexponential algorithm for discrete logarithms over all finite fields, Advances in cryptology---CRYPTO '93 (Santa Barbara, CA,
On Small Degree Extension Fields in Cryptology - Granger (2005) (Correct)
No context found.
L. M. Adleman and J. DeMarrais. A subexponential algorithm for discrete logarithms over all finite fields. Mathematics of Computation, 61 (203), 1--15, 1993.
On the Security of RSA Padding - Published In Wiener (Correct)
No context found.
L. Adleman, A subexponential algorithm for the discrete logarithm problem with applications to cryptography, Proceedings of the IEEE 20-th Annual symposium on the foundations of computer science, pp. 55-60, 1979.
On the Security of RSA Padding - Published In Wiener (Correct)
No context found.
L. Adleman, A subexponential algorithm for the discrete logarithm problem with applications to cryptography, Proceedings of the IEEE 20-th Annual symposium on the foundations of computer science, pp. 55-60, 1979.
Efficient Primitives from Exponentiation in Z_p - Jiang (2006) (Correct)
No context found.
L. M. Adleman, A Subexponential Algorithm for the Discrete Logarithm Problem with Applications to Cryptography (Abstract), FOCS 1979, pp. 55-60, 1979.
Diffie-Hellman Key Exchange Protocol, Its Generalization and.. - Mahalanobis (2005) (Correct)
No context found.
L. Adleman, A subexponential algorithm for the discrete logarithm problem with application to cryptography, Proceedings IEEE 20th annual symposium on foundations of computer science, 1979, pp. 55--60.
Index Calculus in Class Groups of Plane Curves of Small Degree - Diem (2005) (1 citation) (Correct)
No context found.
L. Adleman, J. DeMarrais, and M.-D. Huang. A Subexponential Algorithm for Discrete Logarithms over the Rational Subgroup of the Jacobians of Large Genus Hyperelliptic Curves over Finte Fields. In volume 877 of LNCS, pages 28--40, Berlin, 1994. Springer-Verlag.
Discrete Logarithms: the Effectiveness of the Index.. - Schirokauer, Weber, Denny (1996) (3 citations) (Correct)
No context found.
L.M. Adleman, J. DeMarrais, M.-D. Huang, A subexponential algorithm for discrete logarithms of large genus hyperelliptic curves over finite fields, Algorithmic number theory, Lecture Notes in Computer Science 877, Springer-Verlag, pp. 28--40, 1994
Discrete Logarithms: the Effectiveness of the Index.. - Schirokauer, Weber, Denny (1996) (3 citations) (Correct)
No context found.
L. M. Adleman, J. DeMarrais, A subexponential algorithm for discrete logarithms over all finite fields, Math. Comp. 61, pp. 1--155, 1993
Discrete Logarithms: the Effectiveness of the Index.. - Schirokauer, Weber, Denny (1996) (3 citations) (Correct)
No context found.
L. M. Adleman, A subexponential algorithm for the discrete logarithm problem with applications to cryptography, Proc. 20th IEEE Found. Comp. Sci. Symp., pp. 55--60, 1979
Discrete Logarithms: Recent Progress - Buchmann, Weber (1 citation) (Correct)
No context found.
L. M. Adleman, J. DeMarrais, and M.-D. Huang. A subexponential algorithm for discrete logarithms over the rational subgroup of the Jacobians of large genus hyperelliptic curves over finite fields. In Algorithmic number theory, number 877 in Lecture Notes in Computer Science, pages 28--40, 1994.
Arithmetic on Superelliptic Curves - Galbraith, Paulus, Smart (1998) (14 citations) (Correct)
No context found.
L. Adleman, J. De Marrais, and M.-D. Huang. A subexponential algorithm for discrete logarithms over the rational subgroup of the Jacobians of large genus hyperelliptic curves over finite fields. In ANTS-1 : Algorithmic Number Theory, L. Adleman and M.-D. Huang, editors. Springer-Verlag, LNCS 877, 1994.
Cryptographic Implications of Hess' Generalized GHS Attack - Menezes, Teske (2004) (Correct)
No context found.
L. Adleman, J. DeMarrais and M. Huang, "A subexponential algorithm for discrete logarithms over the rational subgroup of the jacobians of large genus hyperelliptic curves over finite fields", Algorithmic Number Theory, Lecture Notes in Computer Science, 877 (1994), 28-40.
Crypto for Tiny Objects - Malan (2004) (Correct)
No context found.
L. M. Adleman. A subexponential algorithm for the discrete logarithm problem with applications to cryptography. In Proc. 20th IEEE Found. Comp. Sci. Symp., pages 55--60, 1979.
On the Security of RSA Padding - Coron, Naccache, Stern (1999) (15 citations) (Correct)
No context found.
L. Adleman, A subexponential algorithm for the discrete logarithm problem with applications to cryptography, Proceedings of the IEEE 20-th Annual symposium on the foundations of computer science, pp. 55-60, 1979.
A Public-Key Infrastructure for Key Distribution in TinyOS.. - Malan, Welsh, Smith (2004) (5 citations) (Correct)
No context found.
L. M. Adleman, "A Subexponential Algorithm for the Discrete Logarithm Problem with Applications to Cryptography," in Proc. 20th IEEE Found. Comp. Sci. Symp., 1979, pp. 55--60.
A Comparison of Point Counting methods for Hyperelliptic.. - hEigeartaigh (2004) (Correct)
No context found.
Adleman, L., A subexponential algorithm for the discrete logarithm problem with applications to cryptography, Proc. 20th IEEE Found. Comp. Sci. Symp., 1979, 55-60.
Low-Power, Secure Routing for MICA2 Mote - Duncan, Malan (2004) (Correct)
No context found.
L. M. Adleman. A subexponential algorithm for the discrete logarithm problem with applications to cryptography. In Proc. 20th IEEE Found. Comp. Sci. Symp., pages 55--60, 1979.
A Double Large Prime Variation for Small Genus.. - Gaudry, Thomé (2004) (5 citations) (Correct)
No context found.
L. M. Adleman, J. DeMarrais, and M.-D. Huang. A subexponential algorithm for discrete logarithms over the rational subgroup of the jacobians of large genus hyperelliptic curves over finite fields. In L. Adleman and M.-D. Huang, eds., ANTS-I, vol. 877 of Lecture Notes in Comput. Sci., pp. 28--40. Springer--Verlag, 1994.
Twin Primes Conjecture, 95 - Two-Sided Error Ufd (Correct)
No context found.
L. M. Adleman. A subexponential algorithm for the discrete logarithm problem with applications to cryptography. In 20th Annual Symposium on Foundations of Computer Science, pages 55--60, 1979.
A Survey of Public-Key Cryptosystems - Koblitz, Menezes (Correct)
No context found.
L. Adleman, J. DeMarrais and M. Huang, A subexponential algorithm for discrete logarithms over the rational subgroup of the jacobians of large genus hyperelliptic curves over finite fields, Algorithmic Number Theory: First International Symposium, Lecture Notes in Computer Science, 877 (1994), Springer-Verlag, pp. 28-40.
A Survey of the Timestamping Problem - de Mare, DeCoursey (2004) (Correct)
No context found.
Leonard M. Adleman and Jonathon DeMarrais. A subexponential algorithm for discrete logarithms over all discrete fields. In Douglas R. Stinson, editor, Advances in Cryptology - Crypto '93, pages 147--158. Springer-Verlag, 1993.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC