Low Complexity Bit-Parallel Squarer for GF(2^n) Defined by Irreducible Trinomials(Algorithms and Data Structures)

スポンサーリンク

概要

• 論文の詳細を見る

• We present a bit-parallel squarer for GF(2^n) defined by an irreducible trinomial x^n+x^k+1 using a shifted polynomial basis. The pro-posed squarer requires T_X delay and at most [n/2] XOR gates, where T_X is the delay of one XOR gate. As a result, the squarer using the shifted polynomial basis is more efficient than one using the polynomial basis except for k=1 or n/2.

• 社団法人電子情報通信学会の論文
• 2006-09-01

著者

• Chang Ku-young

  Information Security Research Division Electronics And Telecommunications Research Institute

• Park Sun-mi

  Department Of Mathematics Korea 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)
• 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

スポンサーリンク