【24h】

Semi-systolic Architecture for Modular Multiplication over GF(2~m)

机译:GF(2〜m)上模乘的半收缩架构

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

摘要

This paper proposes a new algorithm and an architecture for it to compute the modular multiplication over GF(2~m). They are based on the standard basis representation and use the property of irreducible all one polynomial as a modulus. The architecture, named SSM(Semi-Systolic Multiplier) has the critical path with 1-D_(AND)+1-D_(XOR) Per cell and the latency of m+1. It has a lower latency and a smaller hardware complexity than previous architectures. Since the proposed architecture has regularity, modularity and concurrency, they are suitable for VLSI implementation.
机译:本文提出了一种新的算法及其架构,用于计算GF(2〜m)上的模乘。它们基于标准的基础表示形式,并使用所有多项式的不可约性作为模量。名为SSM(半收缩期乘数)的体系结构的关键路径为每个单元1-D_(AND)+ 1-D_(XOR),延迟为m + 1。与以前的体系结构相比,它具有较低的延迟和较小的硬件复杂性。由于所提出的体系结构具有规则性,模块化和并发性,因此它们适用于VLSI实现。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号