Publishing Upper Half of RSA Decryption Exponent
In: Advances in Information and Computer Security ISBN: 9783642168246 IWSEC; (2010)
Online
unknown
Zugriff:
In the perspective of RSA, given small encryption exponent e (e.g., e = 216 + 1), the top half of the decryption exponent d can be narrowed down within a small search space. This fact has been previously exploited in RSA cryptanalysis. On the contrary, here we propose certain schemes to exploit this fact towards efficient RSA decryption.
Titel: |
Publishing Upper Half of RSA Decryption Exponent
|
---|---|
Autor/in / Beteiligte Person: | Maitra, Subhamoy ; Sarkar, Santanu ; Sourav Sen Gupta |
Link: | |
Quelle: | Advances in Information and Computer Security ISBN: 9783642168246 IWSEC; (2010) |
Veröffentlichung: | Springer Berlin Heidelberg, 2010 |
Medientyp: | unknown |
ISBN: | 978-3-642-16824-6 (print) |
DOI: | 10.1007/978-3-642-16825-3_3 |
Schlagwort: |
|
Sonstiges: |
|