RNS arithmetic in Fpk and application to fast pairing computation
Résumé
In this work, we are interested in arithmetic on large prime field and their ex-tensions of small degree. We explain why it is very interesting to use RNS arithmetic forthe base field $\mathbb{F}p$ when computations in $\mathbb{F}p^k$ have to be done, essentially thanks to lazyreduction. This is for example the case for pairing computations on ordinary curves (asMNT or BN curves). We show that using RNS can considerably decrease the number ofbasic operations required for a pairing computation in many popular situations.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
