Fast Bit-Parallel Polynomial Basis Multiplier for GF(2m) Defined by Pentanomials Using Weakly Dual Basis

スポンサーリンク

概要

• 論文の詳細を見る

• In this paper, we derive a fast polynomial basis multiplier for GF(2m) defined by pentanomials xm+xk3+xk2+xk1+1 with 1 ≤ k1 < k2 < k3 ≤ m/2 using the presented method by Park and Chang. The proposed multiplier has the time delay TA+(2+⌈log2(m-1)⌉)TX or TA+(3+⌈log2(m-1)⌉)TX which is the lowest one compared with known multipliers for pentanomials except for special types, where TA and TX denote the delays of one AND gate and one XOR gate, respectively. On the other hand, its space complexity is very slightly greater than the best known results.

著者

• 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

スポンサーリンク