Bit-Parallel Cubing Computation over GF(3m) for Irreducible Trinomials

スポンサーリンク

概要

• 論文の詳細を見る

• We propose a parallel pth powering method over an arbitrary finite field GF(pm). Using the proposed method, we present the explicit formulae for the computation of cubing over a ternary field GF(3m) which is defined by irreducible trinomials. We show that the field cubing computation for irreducible trinomials, which plays an important role in calculating pairing, can be implemented very efficiently.

• The Institute of Electronics, Information and Communication Engineersの論文

著者

• Park Sun-mi

  Department Of Mathematics Korea University

• CHANG Ku-Young

  Cryptography Research Section, Electronics and Telecommunications Research Institute

• HONG Dowon

  Department of Applied Mathematics, Kongju National University

• SEO Changho

  Department of Applied Mathematics, Kongju National University

• PARK Sun-Mi

  Department of Applied Mathematics, Kongju National University

関連論文

• Low Complexity Bit-Parallel Squarer for GF(2^n) Defined by Irreducible Trinomials(Algorithms and Data Structures)
• Scalable Privacy-Preserving t-Repetition Protocol with Distributed Medical Data
• Fast Bit-Parallel Polynomial Basis Multiplier for GF(2m) Defined by Pentanomials Using Weakly Dual Basis
• Bit-Parallel Cubing Computation over GF(3m) for Irreducible Trinomials

スポンサーリンク