完整後設資料紀錄
| DC 欄位 | 值 | 語言 |
|---|---|---|
| dc.contributor.author | Chen, Chen-Yuan | |
| dc.date.accessioned | 2009-06-02T07:22:02Z | |
| dc.date.accessioned | 2020-05-29T06:16:56Z | - |
| dc.date.available | 2009-06-02T07:22:02Z | |
| dc.date.available | 2020-05-29T06:16:56Z | - |
| dc.date.issued | 2006-11-13T01:14:35Z | |
| dc.date.submitted | 1999-12-20 | |
| dc.identifier.uri | http://dspace.fcu.edu.tw/handle/2377/3111 | - |
| dc.description.abstract | An attack on the short secret exponent dq modulo a larger RSA prime q is presented. When dq ＜(2q/3q)1/2 and e ＜ (pq)1/2, we can discover dq from the continued fraction of e/pq, where e and pq denote the public exponent and the modulus, respectively. Furthermore, the same attack on unbalanced RSA is also given. According to our analysis, unbalanced RSA will be broken if dq ＜(2/3)1/2q4/9. | |
| dc.description.sponsorship | 淡江大學, 台北縣 | |
| dc.format.extent | 5p. | |
| dc.format.extent | 262487 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | zh_TW | |
| dc.relation.ispartofseries | 1999 NCS會議 | |
| dc.subject | RSA | |
| dc.subject | continued fraction method | |
| dc.subject | cryptograph | |
| dc.subject.other | Number Theory and Cryptanalysis | |
| dc.title | Cryptanalysis of Short Secret Exponents Modulo RSA Primes | |
| 分類: | 1999年 NCS 全國計算機會議 | |
文件中的檔案：
| 檔案 | 描述 | 大小 | 格式 | |
|---|---|---|---|---|
| ce07ncs001999000177.pdf | 258.21 kB | Adobe PDF | 檢視/開啟 |
在 DSpace 系統中的文件，除了特別指名其著作權條款之外，均受到著作權保護，並且保留所有的權利。