On the embedding degree of reductions of an elliptic curve

Authors:
Alina Carmen Cojocaru;Igor E. Shparlinski
Affiliations:
Dept. of Mathematics, Statistics and Computer Science, University of Illinois at Chicago, Chicago, IL 60607-7045, USA;Dept. of Computing, Macquarie University, Sydney, NSW 2109, Australia
Venue:
Information Processing Letters
Year:
2009

Citing 4
Cited 0

Identity-Based Encryption from the Weil Pairing

SIAM Journal on Computing
A One Round Protocol for Tripartite Diffie-Hellman

ANTS-IV Proceedings of the 4th International Symposium on Algorithmic Number Theory
Short Signatures from the Weil Pairing

Journal of Cryptology
Reducing elliptic curve logarithms to logarithms in a finite field

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.89

Visualization

Abstract

Given an elliptic curve E over Q we estimate the number of primes p=