A parallel k-partition method to perform Montgomery Multiplication

Application-Specific Systems, Architectures and Processors（2011）

引用 29|浏览0

暂无评分

摘要

This paper proposes a new approach to speed up the Montgomery Multiplication by distributing the multiplier operand bits into k partitions that can process in parallel. Each partition executes in n/k steps. A computation step, although operating in radix 2

查看译文

关键词

k partition,computation step,k step,multiplier operand bit,montgomery multiplication,parallel k-partition method,new approach,computer architecture,adders,matrix multiplication,hardware,fault tolerant,modular exponentiation,public key cryptography,cryptography

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要