Invention Grant
- Patent Title: Modular multiplication acceleration circuit and method for data encryption/decryption
- Patent Title (中): 模块化乘法加速电路和数据加密/解密方法
-
Application No.: US11393392Application Date: 2006-03-30
-
Publication No.: US07693926B2Publication Date: 2010-04-06
- Inventor: Sanu Mathew , Ram Krishnamurthy , Zheng Guo
- Applicant: Sanu Mathew , Ram Krishnamurthy , Zheng Guo
- Applicant Address: US CA Santa Clara
- Assignee: Intel Corporation
- Current Assignee: Intel Corporation
- Current Assignee Address: US CA Santa Clara
- Agency: Buckley, Maschoff & Talwalkar LLC
- Main IPC: G06F7/38
- IPC: G06F7/38

Abstract:
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.
Public/Granted literature
- US20070233772A1 Modular multiplication acceleration circuit and method for data encryption/decryption Public/Granted day:2007-10-04
Information query