Identity-Based Encryption from the Weil Pairing
SIAM Journal on Computing
A One Round Protocol for Tripartite Diffie–Hellman
Journal of Cryptology
Short Signatures from the Weil Pairing
Journal of Cryptology
The Weil Pairing, and Its Efficient Calculation
Journal of Cryptology
Elliptic Curves Suitable for Pairing Based Cryptography
Designs, Codes and Cryptography
Efficient pairing computation on supersingular Abelian varieties
Designs, Codes and Cryptography
International Journal of Information Security
Efficient and generalized pairing computation on Abelian varieties
IEEE Transactions on Information Theory
A Taxonomy of Pairing-Friendly Elliptic Curves
Journal of Cryptology
IEEE Transactions on Information Theory
Constructing pairing-friendly elliptic curves with embedding degree 10
ANTS'06 Proceedings of the 7th international conference on Algorithmic Number Theory
Pairing-Friendly elliptic curves of prime order
SAC'05 Proceedings of the 12th international conference on Selected Areas in Cryptography
IEEE Transactions on Information Theory
Ordinary abelian varieties having small embedding degree
Finite Fields and Their Applications
On the minimal embedding field
Pairing'07 Proceedings of the First international conference on Pairing-Based Cryptography
Hi-index | 0.00 |
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 also be shown that almost all cryptographically useful/meaningful parameters satisfy the mild condition. Hence the simple and exact formula is valid for them. It will also turn out that the formula depends only on essentially two parameters, providing freedom to choose the other parameters to address the design issues other than minimizing the loop length.