Prime number generation device and method
| 专利类型 | 发明公开 | 法律事件 | |
| 专利有效性 | 无效专利 | 当前状态 | |
| 申请号 | EP09250320.0 | 申请日 | 2009-02-09 |
| 公开(公告)号 | EP2104031A3 | 公开(公告)日 | 2012-02-08 |
| 申请人 | Renesas Electronics Corporation; | 申请人类型 | 企业 |
| 发明人 | Vuillaume, Camile; Okeya, Katsuyuki; Yoshino, Masayuki; | 第一发明人 | Vuillaume, Camile |
| 权利人 | Renesas Electronics Corporation | 权利人类型 | 企业 |
| 当前权利人 | Renesas Electronics Corporation | 当前权利人类型 | 企业 |
| 省份 | 当前专利权人所在省份： | 城市 | 当前专利权人所在城市： |
| 具体地址 | 当前专利权人所在详细地址：1753 Shimonumabe, Nakahara-ku Kawasaki-shi, Kanagawa JP | 邮编 | 当前专利权人邮编： |
| 主IPC国际分类 | G06F7/72 | 所有IPC国际分类 | G06F7/72 |
| 专利引用数量 | 3 | 专利被引用数量 | 0 |
| 专利权利要求数量 | 0 | 专利文献类型 | A3 |
| 专利代理机构 | Calderbank, Thomas Roger | 专利代理人 | |
| 摘要 | A technique which contributes to materialization of efficient encryption even with devices such as smartcards restricted in memory resource is provided. The system for generating cryptographic keys includes: - a calculation unit for reconstructing a large number of small primes, - a sieving unit for checking the divisibility of an integer by small primes, - a recoding unit for changing the representation of an integer, - a primality testing unit. First, the sieving unit eliminates "bad" candidates by checking their divisibility by small primes reconstructed by the calculation unit. After that, the primality of the remaining candidates is tested using the primality testing unit. The primality testing unit uses the recoding unit to change the representation of prime candidates. The primality testing unit performs a primality test using the represention after change. Thus, the number of operations for the primality test can be decreased without further memory requirements. |
||
QQ群二维码
意见反馈
意见反馈