Learn More
In this paper, we propose a new method for constructing a bilinear pairing over (hyper)elliptic curves, which we call the Rate pairing. This pairing is a generalization of the Ate and Ate i pairing, and also improves efficiency of the pairing computation. Using the Rate pairing, the loop length in Miller's algorithm can be as small as log(r 1/φ(k)) for some(More)
We provide a simple and exact formula for the minimum Miller loop length in Ate i pairing based on Brezing-Weng curves, in terms of the involved parameters, under a mild condition on the parameters. It will be also shown that almost all cryptographically useful/meaningful parameters satisfy the mild condition. Hence the simple and exact formula is valid for(More)