More constructing pairing-friendly elliptic curves for cryptography

Details More constructing pairing-friendly elliptic curves for cryptography More constructing pairing-friendly elliptic curves for cryptography

2007-11-13

arxiv.org/abs/0711.1942v1

Mathematics

Number Theory

Scientific paper

The problem of constructing elliptic curves suitable for pairing applications
has received a lot of attention. To solve this, we propose a variant algorithm
of a known method by Brezing and Weng. We produce new families of parameters
using our algorithm for pairing-friendly elliptic curves of embedding degree 8,
and we actually compute some explicit curves as numerical examples.

Affiliated with

Also associated with

No associations

Rating

More constructing pairing-friendly elliptic curves for cryptography does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with More constructing pairing-friendly elliptic curves for cryptography, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and More constructing pairing-friendly elliptic curves for cryptography will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-270347