Efficient multiplication in double-struck F sign3ℓm, m ≥ 1 and 5 ≤ ℓ ≤ 18

Date

2008-06-14

Author

Cenk, Murat
Özbudak, Ferruh

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

7
views

0
downloads

Using a method based on Chinese Remainder Theorem for polynomial multiplication and suitable reductions, we obtain an efficient multiplication method for finite fields of characteristic 3. Large finite fields of characteristic 3 are important for pairing based cryptography [3]. For 5 <= l <= 18, we show that our method gives canonical multiplication formulae over F-3lm for any m >= 1 with the best multiplicative complexity improving the bounds in [6]. We give explicit formula in the case F-36.97.

Subject Keywords

Chinese Remainder Theorem, Finite field multiplication, Pairing based cryptography

URI

https://hdl.handle.net/11511/30779

DOI

https://doi.org/10.1007/978-3-540-68164-9_27

Collections

Graduate School of Applied Mathematics, Conference / Seminar

Citation Formats

M. Cenk and F. Özbudak, “Efficient multiplication in double-struck F sign3ℓm, m ≥ 1 and 5 ≤ ℓ ≤ 18,” presented at the 1st International Conference on Cryptology in Africa, Casablanca, MOROCCO, 2008, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/30779.