arXiv · 0711.1942
More constructing pairing-friendly elliptic curves for cryptography
Abstract
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.
Explore related subjects
Keep this discovery
Tanaka Satoru, Nakamula Ken. 2007-11-13. More constructing pairing-friendly elliptic curves for cryptography. https://arxiv.org/abs/0711.1942
Cite the original work for its findings. Save a collection to share your selection of sources.