Issue Date: 6-7 March 2010rnrntOn page(s): rnt173rnttrn- 176rnrnrnLocation: Wuhan, ChinarnrnPrint ISBN: 978-1-4244-6388-6rnrnrnrnttrnDigital Object Identifier: href=''http://dx.doi.org/10.1109/ETCS.2010.375'' target=''_blank''>10.1109/ETCS.2010.375 rnrnDate of Current Version: trnrnt2010-05-06 14:33:52.0rnrnt rntt class="body-text">rntname="Abstract">>Abstractrn>A novel modular multiplier is implemented on FPGA for elliptic curve cryptography (ECC) over GF(p). First, using the embedded 18×18-bit multipliers in the FPGA device, we design a 256-bit Montgomery modular multiplier which spends 3 clock cycles to compute a modular multiplication. Second, the algorithm for Karatusba-Ofman multiplication is used to reduce the number o;
Elliptic curve cryptography (ECC); Karatusba-Ofman multiplication; Montgomery modular multiplication;
机译:基于FPGA的Montgomery模块化倍增器的优化设计
机译:RSA密码系统的高能效高通量蒙哥马利模块化乘法器
机译:用于ECC应用的全字蒙哥马利乘法器的高速FPGA实现
机译:256位蒙哥马利模块化乘法器的高通量FPGA实现
机译:一种基于改进的蒙哥马利乘法算法的高速模块化乘法器体系结构。
机译:基于FPGA的电子皮肤实现实时数字信号处理
机译:FPGA与基数-8可扩展蒙哥马利模块化倍增器的ASIC实现。(DEPT.E)FPGA与ASIC实现的基数-8可扩展蒙格组合模块化倍增仪(DEPT.E)