Use of elliptic curves in cryptography
Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
Discrete logarithms in GF(P) using the number field sieve
SIAM Journal on Discrete Mathematics
A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves
Mathematics of Computation
A subexponential algorithm for discrete logarithms over all finite fields
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Function field sieve method for discrete logarithms over finite fields
Information and Computation
Elliptic curves in cryptography
Elliptic curves in cryptography
The index calculus method using non-smooth polynomials
Mathematics of Computation
ANTS-I Proceedings of the First International Symposium on Algorithmic Number Theory
A subexponential algorithm for the discrete logarithm problem with applications to cryptography
SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science
Comparing the MOV and FR reductions in elliptic curve cryptography
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
The Tate pairing and the discrete logarithm applied to elliptic curve cryptosystems
IEEE Transactions on Information Theory
On the complexity of the discrete logarithm and Diffie-Hellman problems
Journal of Complexity - Special issue on coding and cryptography
Reliable food traceability using RFID tagging
FC'10 Proceedings of the 14th international conference on Financial cryptograpy and data security
| Hi-index | 0.00 |
We review the construction of a generalization of the Weil pairing, which is non-degenerate and bilinear, and use it to construct a reduction from the discrete logarithm problem on elliptic curves to the discrete logarithm problem in finite fields, which is efficient for curves with trace of Frobenius congruent to 2mo dulo the order of the base point. The reduction is as simple to construct as that of Menezes, Okamoto, and Vanstone [16], and is provably equivalent to that of Frey and R眉ck [10].