首页> 外文期刊>Advances in computational sciences and technology >FCS Based Montgomery Modular Multiplication
【24h】

FCS Based Montgomery Modular Multiplication

机译:基于FCS的蒙哥马利模乘

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

摘要

Security plays an important role in the present generation. It is considered in three matters i.e., confidentiality, integrity & availability. All this will come with an efficient cryptographic algorithm which is achieved by repeating modular multiplications on large integers. To increase the speed by encryption decryption process, high speed Montgomery modular multiplication algorithms, hardware architectures employs carry save addition to avoid the carry propagation at the addition operation of the add-shift loop. We proposed an energy-efficient algorithm and its corresponding architecture are not only to reduce the energy consumption but also further enhance the throughput of Montgomery modular multipliers.This architecture which is capable of bypassing the superfluous carry-save addition and register write operations, which leads to less energy consumption. In addition we modified the barrel register full adder (BRFA) so that the gated clock design is applied significantly to reduce the energy consumption of storage elements in BRFA.
机译:安全在当今这一代中起着重要作用。它在三个方面考虑,即机密性,完整性和可用性。所有这些都将通过有效的密码算法实现,该算法通过在大整数上重复模块化乘法来实现。为了通过加密解密过程,高速蒙哥马利模块化乘法算法来提高速度,硬件体系结构采用了进位保存加法以避免加法移位循环的加法操作中的进位传播。我们提出了一种节能算法,其相应的体系结构不仅可以减少能耗,还可以进一步提高蒙哥马利模乘器的吞吐量。 r n该体系结构能够绕过多余的进位保存加法和寄存器写操作,从而减少能耗。此外,我们修改了桶形寄存器全加法器(BRFA),以便显着应用门控时钟设计以减少BRFA中存储元件的能耗。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号