返回
New iterative algorithms for modular multiplication
DOI:10.1016/j.sigpro.2004.07.001.png)
摘要
En 中文
The new modular multiplier structures proposed in this paper are based on a short precision magnitude comparison instead of the full magnitude comparison operation. Another feature of these structures is that the comparison operations are carried out first. Only once this has been achieved that the reduction operation takes place, while in previous work both the comparison and the reduction operations are interleaved. This has resulted in a reduction of the number of stages required for the implementation of the modular reduction operation. Serial implementations have shown that the new radix-2 algorithm has a better area usage than similar structures available in the literature while the proposed radix-4 algorithm exhibits better area usage than similar structures with relatively similar speed performances. The parallel implementation of these algorithms has also shown that the new radix-4 algorithm has the best area usage while its speed performances are similar to that of structures proposed in the literature. (C) 2004 Elsevier B.V. All rights reserved.
Keyword:
modular multiplication
cryptography
serial-parallel systems
computer arithmetic
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.9K
被引数:
1.7W
机构
暂无机构信息
引用论文
Advanced Automated Model for Robust Bone Marrow Segmentation in Whole-body MRI高级自动化模型用于全身MRI的鲁棒骨髓分割
ACADEMIC RADIOLOGY
IF3.9
没有更多内容

