发明申请
- 专利标题: Modular multiplication acceleration circuit and method for data encryption/decryption
- 专利标题(中): 模块化乘法加速电路和数据加密/解密方法
-
申请号: US11393392申请日: 2006-03-30
-
公开(公告)号: US20070233772A1公开(公告)日: 2007-10-04
- 发明人: Sanu Mathew , Ram Krishnamurthy , Zheng Guo
- 申请人: Sanu Mathew , Ram Krishnamurthy , Zheng Guo
- 主分类号: G06F7/52
- IPC分类号: G06F7/52
摘要:
A system to process multiplier X and multiplicand Y may include multiplication of a least-significant bit of X and a least-significant w bits of Y to generate a least-significant w bits of product Z. The system may further include determination of whether a least-significant bit of product Z is 1, addition of a least-significant w bits of modulus M to the least-significant w bits of product Z if the least-significant bit of product Z is 1, multiplication of the least-significant bit of X and bits 2w-1:w of Y to generate bits 2w-1:w of product Z, and addition of bits 2w-1:w of modulus M to bits 2w-1:w of product Z if the least-significant bit of product Z is 1. Multiplying the least-significant bit of X and bits 2w-1:w of Y may occur at least partially contemporaneously with multiplying the least-significant bit of X and the least-significant w bits of Y, determining if the least-significant bit of product Z is 1, and adding the least-significant w bits of modulus M to the least-significant w bits of product Z if the least-significant bit of product Z is 1.
公开/授权文献
信息查询