Avoiding full extension field arithmetic in pairing computations
Costello, Craig, Boyd, Colin, Gonzalez Nieto, Juan M., & Wong, Kenneth Koon-Ho (2010) Avoiding full extension field arithmetic in pairing computations. In Progress in Cryptology - AFRICACRYPT 2010, Springer Verlag, Stellenbosch, South Africa, pp. 203-224.
The most costly operations encountered in pairing computations are those that take place in the full extension ﬁeld Fpk . At high levels of security, the complexity of operations in Fpk dominates the complexity of the operations that occur in the lower degree subﬁelds. Consequently, full extension ﬁeld operations have the greatest eﬀect on the runtime of Miller’s algorithm. Many recent optimizations in the literature have focussed on improving the overall operation count by presenting new explicit formulas that reduce the number of subﬁeld operations encountered throughout an iteration of Miller’s algorithm. Unfortunately, almost all of these improvements tend to suﬀer for larger embedding degrees where the expensive extension ﬁeld operations far outweigh the operations in the smaller subﬁelds. In this paper, we propose a new way of carrying out Miller’s algorithm that involves new explicit formulas which reduce the number of full extension ﬁeld operations that occur in an iteration of the Miller loop, resulting in signiﬁcant speed ups in most practical situations of between 5 and 30 percent.
Impact and interest:
Citation countsare sourced monthly fromand citation databases.
These databases contain citations from different subsets of available publications and different time periods and thus the citation count from each is usually different. Some works are not in either database and no count is displayed. Scopus includes citations from articles published in 1996 onwards, and Web of Science® generally from 1980 onwards.
Citations counts from theindexing service can be viewed at the linked Google Scholar™ search.
Full-text downloadsdisplays the total number of times this work’s files (e.g., a PDF) have been downloaded from QUT ePrints as well as the number of downloads in the previous 365 days. The count includes downloads for all files if a work has more than one.
|Item Type:||Conference Paper|
|Keywords:||Pairings, Miller's algorithm, Tate pairing, ate pairing|
|Subjects:||Australian and New Zealand Standard Research Classification > INFORMATION AND COMPUTING SCIENCES (080000) > COMPUTATION THEORY AND MATHEMATICS (080200) > Computation Theory and Mathematics not elsewhere classified (080299)|
|Divisions:||Past > QUT Faculties & Divisions > Faculty of Science and Technology|
Past > Institutes > Information Security Institute
|Copyright Owner:||Copyright 2010 Springer|
|Copyright Statement:||This is the author-version of the work. Conference proceedings published by Springer Verlag, will be available via SpringerLink http://www.springer.de/comp/lncs/|
|Deposited On:||20 Aug 2010 11:17|
|Last Modified:||01 Mar 2012 00:17|
Repository Staff Only: item control page