首页> 外文期刊>IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences >Fast Bit-Parallel Polynomial Basis Multiplier for GF(2~m) Defined by Pentanomials Using Weakly Dual Basis
【24h】

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

机译:由五项式使用弱对偶基定义的GF(2〜m)快速位并行多项式基乘

获取原文
获取原文并翻译 | 示例
           

摘要

In this paper, we derive a fast polynomial basis multiplier for GF(2~m) denned by pentanomials x~m + x~(k_3) + x~(k_2) + x~(k_1) + 1 with 1 ≤ k_1 < k_2 < k_3 ≤ m/2 using the presented method by Park and Chang. The proposed multiplier has the time delay T_A + (2 + [log_2(m ~ 1)])T_x or T_A + (3 + [log_2(m - 1)])T_x which is the lowest one compared with known multipliers for pentanomials except for special types, where T_A and T_X 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.
机译:在本文中,我们得出了由五项式x〜m + x〜(k_3)+ x〜(k_2)+ x〜(k_1)+ 1定义的GF(2〜m)的快速多项式基乘数,其中1≤k_1

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号