Abstract
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. © 2010 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Maitra, S., Sarkar, S., & Sen Gupta, S. (2010). Publishing upper half of RSA decryption exponent. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6434 LNCS, pp. 25–39). Springer Verlag. https://doi.org/10.1007/978-3-642-16825-3_3
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
