排序方式: 共有4条查询结果,搜索用时 0 毫秒
1
1.
A modified extended binary Euclid' s algorithm which is more regularly iterative for computing an inversion in GF(2^m) is presented. Based on above modified algorithm, a serial-in serial-out architecture is proposed. It has area complexity of O(m), latency of 5m - 2, and throughput of 1/m. Compared with other serial systolic arehiteetures, the proposed one has the smallest area complexity, shorter latency. It is highly regular, modular, and thus well suited for high-speed VLSI design. 相似文献
2.
3.
4.
一种并行的有限域乘法器结构 总被引:2,自引:1,他引:1
提出了一种并行的有限域GF(2^m)乘法器结构.有限域乘法由多项式乘法和模不可约多项式f(x)两步实现.把多项式被乘数和乘数各自平分成3个子多项式,多项式乘法由子多项式的乘法和加法实现.当多项式的度m=500时,与传统的Mastrivito多项式乘法相比,所提出的多项式乘法结构可以减少33.1%的异或门,减少33.3%的与门.为了简化,采用特殊不可约多项式来产生有限域,此有限域乘法器结构适合高安全度的椭圆曲线密码算法的VLSI设计. 相似文献
1