Welcome to the resource topic for 2010/555
Title:
RNS arithmetic in {\mathbb F}_{p^k} and application to fast pairing computation
Authors: 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.
ePrint: https://eprint.iacr.org/2010/555
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .