Simple and exact formula for minimum loop length in \(\mathrm{Ate}_{i }\) pairing based on Brezing-Weng curves (Q1943983)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Simple and exact formula for minimum loop length in \(\mathrm{Ate}_{i }\) pairing based on Brezing-Weng curves |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Simple and exact formula for minimum loop length in \(\mathrm{Ate}_{i }\) pairing based on Brezing-Weng curves |
scientific article |
Statements
Simple and exact formula for minimum loop length in \(\mathrm{Ate}_{i }\) pairing based on Brezing-Weng curves (English)
0 references
3 April 2013
0 references
The authors derive a formula for the minimum loop of the \(\mathrm{Ate}_i\) pairing based on some class of Brezing-Weng curves, namely Theorem~1 in the paper. Note that the \(\mathrm{Ate}_i\) pairing is one of the several pairings that have appeared in elliptic curve cryptography. The class of curves analyzed under the conditions of Theorem~1 in the paper covers almost all the interesting Brezing-Weng curves in cryptographic terms
0 references
pairing-based cryptosystem
0 references
elliptic curves
0 references
Miller algorithm
0 references
