2008
Integer Variable chi-Based Ate Pairing
PAIRING-BASED CRYPTOGRAPHY - PAIRING 2008
- ,
- ,
- ,
- ,
- Volume
- 5209
- Number
- First page
- 178
- Last page
- +
- Language
- English
- Publishing type
- DOI
- 10.1007/978-3-540-85538-5_13
- Publisher
- SPRINGER-VERLAG BERLIN
In implementing an efficient pairing calculation, it is said that the lower bound of the number of iterations of Miller's algorithm is log(2)r/phi(k), where phi(.) is the Euler's function. Ate pairing reduced the number of the loops of Miller's algorithm of Tate pairing from left perpendicularlog(2)rright perpendicular to left perpendicularlog(2)(t - 1)right perpendicular. Recently, it is known to systematically prepare a pairing-friendly elliptic curve whose parameters are given by a polynomial of integer variable "chi". For the curve, this paper gives integer variable chi-based Ate pairing that achieves the lower bound by reducing it to left perpendicularlog(2) chi right perpendicular.
- Link information
-
- DOI
- https://doi.org/10.1007/978-3-540-85538-5_13
- DBLP
- https://dblp.uni-trier.de/rec/conf/pairing/NogamiASKM08
- Web of Science
- https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=JSTA_CEL&SrcApp=J_Gate_JST&DestLinkType=FullRecord&KeyUT=WOS:000260883900013&DestApp=WOS_CPL
- URL
- https://dblp.uni-trier.de/conf/pairing/2008
- URL
- https://dblp.uni-trier.de/db/conf/pairing/pairing2008.html#NogamiASKM08
- Scopus
- https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=52449098485&origin=inward
- Scopus Citedby
- https://www.scopus.com/inward/citedby.uri?partnerID=HzOxMe3b&scp=52449098485&origin=inward
- ID information
-
- DOI : 10.1007/978-3-540-85538-5_13
- ISSN : 0302-9743
- eISSN : 1611-3349
- DBLP ID : conf/pairing/NogamiASKM08
- SCOPUS ID : 52449098485
- Web of Science ID : WOS:000260883900013