More constructing pairing-friendly elliptic curves for cryptography
Number Theory
2007-11-14 v1
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.
Keywords
Cite
@article{arxiv.0711.1942,
title = {More constructing pairing-friendly elliptic curves for cryptography},
author = {Tanaka Satoru and Nakamula Ken},
journal= {arXiv preprint arXiv:0711.1942},
year = {2007}
}