Cryptology ePrint Archive: Report 2009/556

Constructing Tower Extensions for the implementation of Pairing-Based Cryptography

Naomi Benger and Michael Scott

Abstract: A cryptographic pairing evaluates as an element in an extension field, and the evaluation itself involves a considerable amount of extension field arithmetic. It is recognised that organising the extension field as a ``tower'' of subfield extensions has many advantages. Here we consider criteria that apply when choosing the best towering construction, and the associated choice of irreducible polynomials for the implementation of pairing-based cryptosystems. We introduce a method for automatically constructing efficient towers for more congruency classes than previous methods, some of which allow faster arithmetic.

Category / Keywords: Pairing implementation, pairing-based cryptosystems

Date: received 13 Nov 2009, last revised 2 Aug 2010

Contact author: nbenger at computing dcu ie

Available formats: PDF | BibTeX Citation

Version: 20100802:103155 (All versions of this report)

Discussion forum: Show discussion | Start new discussion