QUT ePrints

Delaying mismatched field multiplications in pairing computations

Costello, Craig, Boyd, Colin, Gonzalez Nieto, Juan M., & Wong, Kenneth Koon-Ho (2010) Delaying mismatched field multiplications in pairing computations. In Arithmetic of Finite Fields : Third International Workshop, WAIFI 2010, Proceedings, Springer Verlag, Istanbul, Turkey, pp. 196-214.

[img] Conference Paper (PDF 268kB)
Accepted Version.

    View at publisher


    Miller’s algorithm for computing pairings involves perform- ing multiplications between elements that belong to different finite fields. Namely, elements in the full extension field Fpk are multiplied by elements contained in proper subfields F pk/d , and by elements in the base field Fp . We show that significant speedups in pairing computations can be achieved by delaying these “mismatched” multiplications for an optimal number of iterations. Importantly, we show that our technique can be easily integrated into traditional pairing algorithms; implementers can exploit the computational savings herein by applying only minor changes to existing pairing code.

    Impact and interest:

    0 citations in Scopus
    Search Google Scholar™
    0 citations in Web of Science®

    Citation countsare sourced monthly from Scopus and Web of Science® 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 the Google Scholar™ indexing service can be viewed at the linked Google Scholar™ search.

    Full-text downloads:

    78 since deposited on 20 Aug 2010
    23 in the past twelve months

    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.

    ID Code: 34178
    Item Type: Conference Paper
    Additional URLs:
    Keywords: Pairings, Miller's algorithm, finite field arithmetic, Tate pairing, ate pairing
    DOI: 10.1007/978-3-642-13797-6_14
    ISBN: 9783642137976
    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-Verlag Berlin Heidelberg
    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 12:20
    Last Modified: 18 Jul 2014 14:46

    Export: EndNote | Dublin Core | BibTeX

    Repository Staff Only: item control page