EAGL: an elliptic curve arithmetic GPU-based library for bilinear pairing. (English) Zbl 1307.94088

Cao, Zhenfu (ed.) et al., Pairing-based cryptography – Pairing 2013. 6th international conference, Beijing, China, November 22–24, 2013. Revised selected papers. Berlin: Springer (ISBN 978-3-319-04872-7/pbk). Lecture Notes in Computer Science 8365, 1-19 (2014).
Summary: In this paper we present the elliptic curve arithmetic GPU-based library (EAGL), a self-contained GPU library, to support parallel computing of bilinear pairings based on the compute unified device architecture (CUDA) programming model. It implements parallelized point arithmetic, arithmetic functions in the 1-2-4-12 tower of extension fields. EAGL takes full advantage of the parallel processing power of GPU, with no shared memory bank conflict and minimal synchronization and global memory accesses, to compute some most expensive computational steps, especially the conventional-Montgomery-based multi-precision multiplications. At the 128-bit security level, EAGL can perform 3350.9 R-ate pairings/sec on one GTX-680 controlled by one CPU thread. Extensive experiments suggest that performance tradeoffs between utilization of GPU pipeline vs. memory access latency are highly complex for parallelization of pairing computations. Overall, on-chip memory is the main performance bottleneck for pairing computations on the tested GPU device, and the lazy reduction in \( \mathbb{F}_{q^{2}} \) gives the best performance. Increasing the size of on-chip memory, together with caching and memory prefetching modules are expected to offer substantial performance improvement for GPU-based pairing computations.
For the entire collection see [Zbl 1280.94006].


94A60 Cryptography
14G50 Applications to coding theory and cryptography of arithmetic geometry


Full Text: DOI