Cryptology ePrint Archive: Report 2010/555

RNS arithmetic in ${\mathbb F}_{p^k}$ and application to fast pairing computation

S. Duquesne

Abstract: In this work, we are interested in arithmetic in large prime field and their extensions of small degree. We explain why it is very interesting to use RNS arithmetic for the base field ${\mathbb F}_p$ when computations in ${\mathbb F}_{p^k}$ have to be done, essentially thanks to lazy reduction. This is for example the case for pairing computations on ordinary curves (as MNT or BN curves). We prove that using RNS can considerably decrease the number of basic operations required for a pairing computation in many popular situations.

Category / Keywords: public-key cryptography /

Date: received 30 Oct 2010

Contact author: sylvain duquesne at univ-rennes1 fr

Available format(s): PDF | BibTeX Citation

Version: 20101101:164834 (All versions of this report)

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]