頁籤選單縮合
題 名 | Cryptanalysis of the Secret Exponent of the RSA Scheme |
---|---|
作 者 | 陳建源; 張真誠; 楊維邦; | 書刊名 | Journal of Information Science and Engineering |
卷 期 | 12:2 1996.06[民85.06] |
頁 次 | 頁277-290 |
分類號 | 310.15 |
關鍵詞 | The RSA scheme; The continued fraction algorithm; |
語 文 | 英文(English) |
英文摘要 | In this paper, we present a cryptanalytic attack on large RSA secret exponents. Let e and N denote the public exponent and the modulus of the RSA scheme, respectively. This attack uses the continued fraction algorithm to find an estimate of a fraction which involves the secret exponent d from a known close enough estimate of a fraction e/N. According to our proposed attack, the large secret exponent d can be discovered if e < N and . Furthermore, if the secret exponent is close to λ(N)/2, or even if it is close to some other critical value, it will be discovered. |
本系統中英文摘要資訊取自各篇刊載內容。