Cenk, MuratCenk, MuratOzbudak, FerruhMatematik2020-04-082020-04-082008Cenk, Murat; Özbudak, Ferruh, "Efficient multiplication in F-3lm, m >= 1 and 5 <= l <= 18", Progress In Cryptology - Africacrypt 2008, Vol.5023, (2008).354068159097835406815950302-97431611-3349https://doi.org/10.1007/978-3-540-68164-9_27Using 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.eninfo:eu-repo/semantics/closedAccessChinese Remainder TheoremFinite Field MultiplicationPairing Based CryptographyConference Object502340641410.1007/978-3-540-68164-9_272-s2.0-45449109186WOS:000256541200027N/AQ3