CryptoDB
Implementing Cryptographic Pairings over Curves of Embedding Degrees 8 and 10
| Authors: | |
|---|---|
| Download: | |
| Abstract: | In this paper, we will describe efficient implementations of the Tate and Ate pairings over ordinary elliptic curves of embedding degrees 8 and 10. We will discuss the possible curve-dependent optimizations that can be applied to evaluate the pairings. We pay particular attention to the use of elliptic curve twists and the denominator elimination method to make computations more efficient. Our main goal is to draw together the best possible optimizations that can be used to efficiently evaluate the Tate and the Ate pairings in both curves and to give timings and appropriate interpretation on the rate of change on the running time of our programs for both curves. To come up with an adequate conclusion, we will compare the performance of the curves we chose to an already experimented curve of embedding degree 12. |
BibTeX
@misc{eprint-2007-13706,
title={Implementing Cryptographic Pairings over Curves of Embedding Degrees 8 and 10},
booktitle={IACR Eprint archive},
keywords={implementation / bilinear pairings, cryptography, pairing-friendly curves},
url={http://eprint.iacr.org/2007/426},
note={ abby.ballesteros@gmail.com 13830 received 13 Nov 2007},
author={Christine Abegail Antonio and Satoru Tanaka and Ken Nakamula},
year=2007
}