Cryptology ePrint Archive: Report 2022/367

Efficient Algorithms for Large Prime Characteristic Fields and Their Application to Bilinear Pairings and Supersingular Isogeny-Based Protocols

Patrick Longa

Abstract: We propose a novel approach that generalizes interleaved modular multiplication algorithms to the computation of sums of products over large prime fields. This operation has widespread use and is at the core of many cryptographic applications. The method reformulates the widely used lazy reduction technique, crucially avoiding the need for storage and computation of ``double-precision'' operations. Moreover, it can be easily adapted to the different methods that exist to compute modular multiplication, producing algorithms that are significantly more efficient and memory-friendly. We showcase the performance of the proposed approach in the computation of multiplication over an extension field GF(p^k), and demonstrate its impact in two popular cryptographic settings: bilinear pairings and supersingular isogeny-based protocols. For the former, we obtain a 1.37x speedup in the computation of a full optimal ate pairing over the popular BLS12-381 curve on an x64 Intel processor; for the latter, we show a speedup of up to 1.30x in the computation of the SIKE protocol on the same Intel platform.

Category / Keywords: public-key cryptography / Prime fields, extension fields, bilinear pairings, BLS12-381, supersingular isogeny-based cryptography, SIKE, efficient computation.

Date: received 18 Mar 2022, last revised 18 Mar 2022

Contact author: plonga at microsoft com

Available format(s): PDF | BibTeX Citation

Version: 20220322:132454 (All versions of this report)

Short URL: ia.cr/2022/367


[ Cryptology ePrint archive ]