Constructing Elliptic Curves with Prescribed Embedding Degrees
Top Cited Papers
- 14 March 2003
- book chapter
- Published by Springer Nature
- Vol. 2002, 257-267
- https://doi.org/10.1007/3-540-36413-7_19
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Efficient Algorithms for Pairing-Based CryptosystemsPublished by Springer Nature ,2002
- Self-Blindable Credential Certificates from the Weil PairingPublished by Springer Nature ,2001
- Identity-Based Encryption from the Weil PairingPublished by Springer Nature ,2001
- Building Cyclic Elliptic Curves Modulo Large PrimesPublished by Springer Nature ,2001
- A One Round Protocol for Tripartite Diffie–HellmanPublished by Springer Nature ,2000
- The Tate pairing and the discrete logarithm applied to elliptic curve cryptosystemsIEEE Transactions on Information Theory, 1999
- The Improbability That an Elliptic Curve Has Subexponential Discrete Log Problem under the Menezes—Okamoto—Vanstone AlgorithmJournal of Cryptology, 1998
- Elliptic Curve Discrete Logarithms and the Index CalculusPublished by Springer Nature ,1998
- A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of CurvesMathematics of Computation, 1994
- Reducing elliptic curve logarithms to logarithms in a finite fieldIEEE Transactions on Information Theory, 1993