RNS arithmetic in 𝔽pk and application to fast pairing computation
In this work, we are interested in arithmetic on large prime field and their extensions of small degree. We explain why it is very interesting to use RNS arithmetic for the base field 𝔽p when computations in 𝔽pk have to be done, essentially thanks to lazy reduction. This is for example the case for...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
De Gruyter
2011-06-01
|
| Series: | Journal of Mathematical Cryptology |
| Subjects: | |
| Online Access: | https://doi.org/10.1515/jmc.2011.006 |