首页> 外文会议>Euromicro Conference on Digital System Design: Architectures, Methods and Tools >Unified Digit Serial Systolic Montgomery Multiplication Architecture for Special Classes of Polynomials over GF(2m)
【24h】

Unified Digit Serial Systolic Montgomery Multiplication Architecture for Special Classes of Polynomials over GF(2m)

机译:GF(2M)特殊类多项式多项式多项式的统一数字串行收缩系统蒙代架构

获取原文

摘要

This paper presents an unified digit-serial systolic multiplication architecture for all-one polynomials (AOP) and trinomial over GF (2m) for efficient implementation of Montgomery Multiplication (MM) algorithm suitable for cryptosystem. This is the first reported unified digit serial systolic digit level pipelined MM architecture for AOP and trinomials over GF (2). Analysis shows that the latency and circuit complexity of the proposed architecture are significantly less compared to earlier design for same class of polynomials. The proposed multiplier has clock cycle latency of (2N) where N=ém/Lù, m is the word size and L is the digit size.
机译:本文介绍了全项组多项式(AOP)的统一数字串行收缩型架构,并通过GF(2M)初中,以便有效地实现适用于密码系统的蒙哥格玛利乘法(MM)算法。这是第一个报告的统一数字串行收缩位水平流水线MM架构,用于AOP和GF(2)上的Tinomials。分析表明,与早期设计相比,所提出的架构的延迟和电路复杂性显着较低,同一类多项式的多项式。所提出的乘法器具有(2N)的时钟周期延迟,其中n =ém/lù,m是字大小,l是数字大小。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号