Alfred J. Menezes, Tatsuaki Okamoto, and Scott A. Vanstone. Reducing elliptic curve logarithms to logarithms in a finite field. IEEE Trans. Inform. Theory, 39(5):1639--1646, 1993. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Analysis of the GHS Weil Descent Attack on the ECDLP over .. - Maurer, Menezes, Teske (2001) (3 citations) Self-citation (Menezes) (Correct)
No context found.
A. Menezes, T. Okamoto and S. Vanstone, \Reducing elliptic curve logarithms to logarithms in a nite eld", IEEE Transactions on Information Theory, 39 (1993), 1639-1646.
Cryptographic Implications of Hess' Generalized GHS Attack - Menezes, Teske (2004) Self-citation (Menezes) (Correct)
No context found.
A. Menezes, T. Okamoto and S. Vanstone, "Reducing elliptic curve logarithms to logarithms in a finite field", IEEE Transactions on Information Theory, 39 (1993), 1639-1646.
A Survey of Public-Key Cryptosystems - Koblitz, Menezes Self-citation (Menezes) (Correct)
No context found.
A. Menezes, T. Okamoto and S. Vanstone, Reducing elliptic curve logarithms to logarithms in a finite field, IEEE Transactions on Information Theory, 39 (1993), pp. 1639-1646.
On an Improved Definition of Embedding Degree - Laura Hitt Department (Correct)
No context found.
Alfred J. Menezes, Tatsuaki Okamoto, and Scott A. Vanstone. Reducing elliptic curve logarithms to logarithms in a finite field. IEEE Trans. Inform. Theory, 39(5):1639--1646, 1993.
Pairings for Cryptographers - Galbraith, Paterson, Smart (2006) (Correct)
No context found.
A. J. Menezes, T. Okamoto and S. A. Vanstone. Reducing elliptic curve logarithms to logarithms in a finite field. IEEE Trans. Inf. Theory, 39, 1639--1646, 1993.
On Computing Products of Pairings - Granger, Smart (2006) (Correct)
No context found.
A. J. Menezes, T. Okamoto and S. A. Vanstone. Reducing elliptic curve logarithms to logarithms in a finite field. IEEE Trans. Info. Theory, 39, 1639--1646, 1993.
An Improved Remote User Authentication Scheme - With Smart Cards (2006) (Correct)
No context found.
A. J. Menezes, T. Okamoto and S. A. Vanstone, "Reducing elliptic curve logarithms to logarithms in a finite field," IEEE Trans. Inf. Theory, vol.39, no. 5, pp. 1639-1646, 1993.
Efficient Tate Pairing Computation Using Double-Base Chains - Zhao, Zhang, Huang (2006) (Correct)
No context found.
A. Menezes, T. Okamoto, and S. Vanstone. Reducing elliptic curve logarithms to logarithms in a finite field. IEEE Transaction on Information Theory, 39: 16391646, 1993.
Constructing Pairing-Friendly Elliptic Curves with Embedding.. - Freeman (2006) (1 citation) (Correct)
No context found.
A. Menezes, T. Okamoto, S. Vanstone, "Reducing elliptic curve logarithms to logarithms in a finite field," IEEE Transactions on Information Theory 39 (1993), 1639-1646.
Further Refinement Of Pairing Computation Based On Miller's.. - Liu, Horng, Chen (2006) (Correct)
No context found.
A.J. Menezes, T. Okamoto, and S.A. Vanstone, Reducing elliptic curve logarithms to logarithms in a finite field, IEEE Tran. Inform. Theory, vol.39 pp.1639-1646, 1993.
Overview of Key Agreement Protocols - Dutta, Barua (2005) (Correct)
No context found.
A. Menezes, T. Okamoto, and S. Vanstone. Reducing Elliptic Curve Logarithms to Logarithms in a finite field. In IEEE Transaction on Information Theory, 39, pp. 1639-1646, 1993.
Weak keys of pairing based Diffie Hellman schemes on elliptic.. - Kalele, Sule (2005) (Correct)
No context found.
A. J. Menezes, T. Okamoto and S. A. Vanstone, "Reducing elliptic curve logarithm to logarithms in finite fields", IEEE Trans. on Information Theory, vol. 39, pp. 16391646, 1993.
Scaling Security in Pairing-Based Protocols - Scott (2005) (Correct)
No context found.
A. Menezes, T. Okamoto, and S. Vanstone. Reducing elliptic curve logarithms to logarithms in a finite field. IEEE Transactions on Information Theory, 39:1639-- 1646, 1993.
On the Diffie-Hellman problem over GL_n - Kalele, Sule (2005) (Correct)
No context found.
A. J. Menezes, T. Okamoto and S. A. Vanstone, "Reducing elliptic curve logarithm to logarithms in finite fields", IEEE Trans. on Information Theory, vol. 39, pp. 16391646, 1993.
The Vector Decomposition Problem for Elliptic and.. - Duursma, Kiyavash (2005) (Correct)
No context found.
Alfred J. Menezes, Tatsuaki Okamoto, and Scott A. Vanstone. Reducing elliptic curve logarithms to logarithms in a nite eld. IEEE Trans. Inform. Theory, 39(5):1639-1646, 1993.
A Fast Java Implementation of a Provably Secure Pseudo Random Bit.. - Baier (Correct)
No context found.
MOV91. A. Menezes, T. Okamoto, and S. Vanstone. Reducing Elliptic Curve Logarithms to Logarithms in a Finite Field. In Proceedings of the 23rd Annual ACM Symposium on the Theory of Computing, pages 80--89, 1991.
Efficient Algorithms for Pairing-Based Cryptosystems - Stogbauer (2004) (Correct)
No context found.
A. Menezes, T. Okamoto, and S. Vanstone. Reducing Elliptic Curve Logarithms to Logarithms in a Finite Field. IEEE Transaction on Information Theory volume 39, pages 1639-1646, 1993.
Efficient Construction of Cryptographically Strong Elliptic.. - Baier, Buchmann (2001) (Correct)
No context found.
A. Menezes, T. Okamoto, and S. Vanstone. Reducing Elliptic Curve Logarithms to Logarithms in a Finite Field. In Proceedings of the 23rd Annual ACM Symposium on the Theory of Computing, pages 8089, 1991.
Crypto for Tiny Objects - Malan (2004) (Correct)
No context found.
Alfred Menezes, Scott Vanstone, and Tatsuaki Okamoto. Reducing elliptic curve logarithms to logarithms in a finite field. In Proceedings of the twenty-third annual ACM symposium on Theory of computing, pages 80--89. ACM Press, 1991.
A Public-Key Infrastructure for Key Distribution in TinyOS.. - Malan, Welsh, Smith (2004) (5 citations) (Correct)
No context found.
A. Menezes, S. Vanstone, and T. Okamoto, "Reducing Elliptic Curve Logarithms to Logarithms in a Finite Field," in Proceedings of the twentythird annual ACM symposium on Theory of computing. ACM Press, 1991, pp. 80--89.
A Weil Descent Attack against Elliptic Curve.. - Arita, Matsuo, Nagao.. (2004) (Correct)
No context found.
A. Menezes, T. Okamoto, and S. Vanstone. Reducing elliptic curve logarithms to logarithms in a finite fields. In Proc. of STOC, pages 80--89, 1991.
Pairing-Based One-Round Tripartite Key Agreement Protocols - Cheng, Vasiu, Comley (2004) (2 citations) (Correct)
No context found.
A. Menezes, T. Okamoto, S. Vanstone, "Reducing elliptic curve logarithms to logarithms in a finite field," IEEE Transactions on Information Theory 39 (1993), pp. 1639--1646.
Low-Power, Secure Routing for MICA2 Mote - Duncan, Malan (2004) (Correct)
No context found.
A. Menezes, S. Vanstone, and T. Okamoto. Reducing elliptic curve logarithms to logarithms in a finite field. In Proceedings of the twenty-third annual ACM symposium on Theory of computing, pages 80--89. ACM Press, 1991.
Multiple Trusted Authorities in Identifier Based Cryptography .. - Chen, Harrison (2003) (2 citations) (Correct)
No context found.
A.J. Menezes, T. Okamoto and S. Vanstone. Reducing elliptic curve logarithms to logarithms in a finite field. IEEE Transactions on Information Theory, 39:1639-1646, 1993.
Hardware and Software Normal Basis Arithmetic for Pairing.. - Granger, Page, Stam (2004) (1 citation) (Correct)
No context found.
A. Menezes, T. Okamoto, and S. A. Vanstone. Reducing Elliptic Curve Logarithms to Logarithms in a Finite Field. In IEEE Transactions on Information Theory, 39, 1639--1646, 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