发明申请
US20060045263A1 Method and apparatus for efficient generation of modulo inverse for public key cryptosystems
失效
用于公共密钥密码系统的有效生成模倒数的方法和装置
- 专利标题: Method and apparatus for efficient generation of modulo inverse for public key cryptosystems
- 专利标题(中): 用于公共密钥密码系统的有效生成模倒数的方法和装置
-
申请号: US10926598申请日: 2004-08-26
-
公开(公告)号: US20060045263A1公开(公告)日: 2006-03-02
- 发明人: Daniel Brokenshire , Mohammad Peyravian
- 申请人: Daniel Brokenshire , Mohammad Peyravian
- 申请人地址: US NY Armonk
- 专利权人: International Business Machines Corporation
- 当前专利权人: International Business Machines Corporation
- 当前专利权人地址: US NY Armonk
- 主分类号: H04L9/30
- IPC分类号: H04L9/30
摘要:
A method, an apparatus, and a computer program are provided for efficiently determining an inverse multiplicative modulo. In many public-key cryptographic algorithms, an inverse modulo is usually calculated in key generation. However, because many Reduced Instruction Set Computers (RISCs) do not have the hardware support for division, good results are often not yielded. Therefore, to efficiently calculate a inverse modulo, an modified algorithm that utilizes a minimum of 3 division and 2 multiplications in conjunction with shifts and addition/subtractions is employed. The modified algorithm then is able to efficiently utilize the properties of the RISC processors to yield good results, especially when developing keys for public-key cryptographic algorithms.
公开/授权文献
信息查询