This paper describes a new method to speed up double-struck F p-arithmetic for Barreto-Naehrig (BN) curves. We explore the characteristics of the modulus defined by BN curves and choose curve parameters such that double-struck F p multiplication becomes more efficient. The proposed algorithm uses Montgomery reduction in a polynomial ring combined with a coefficient reduction phase using a pseudo-Mersenne number. With this algorithm, the performance of pairings on BN curves can be significantly improved, resulting in a factor 5.4 speed-up compared with the state-of-the-art hardware implementations. Using this algorithm, we implemented a pairing processor in hardware, which runs at 204 MHz and finishes one ate and R-ate pairing computation over a 256-bit BN curve in 4.22 ms and 2.91 ms, respectively. © 2009 Springer.
CITATION STYLE
Fan, J., Vercauteren, F., & Verbauwhede, I. (2009). Faster double-struck F p-arithmetic for cryptographic pairings on Barreto-Naehrig curves. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5747 LNCS, pp. 240–253). https://doi.org/10.1007/978-3-642-04138-9_18
Mendeley helps you to discover research relevant for your work.