Efficient multiplication in F-3lm, m >= 1 and 5 <= l <= 18

Cenk M., ÖZBUDAK F.

1st International Conference on Cryptology in Africa, Casablanca, Fas, 11 - 14 Haziran 2008, cilt.5023, ss.406-409 identifier

  • Yayın Türü: Bildiri / Tam Metin Bildiri
  • Cilt numarası: 5023
  • Basıldığı Şehir: Casablanca
  • Basıldığı Ülke: Fas
  • Sayfa Sayıları: ss.406-409
  • Anahtar Kelimeler: Chinese Remainder Theorem, finite field multiplication, pairing based cryptography, KARATSUBA-LIKE FORMULAS, 6-TERM, 5-TERM
  • Orta Doğu Teknik Üniversitesi Adresli: Evet

Özet

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.