Abstract
The US government has published recommended RSA key sizes to go with AES-256 bit keys. These are huge and it is not clear what is the best strategy to implement modular arithmetic. This paper aims to investigate a set of possibilities from straight Montgomery and Barrett arithmetic through to combining them with Karatsuba and Toom-Cook style techniques. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Bentahar, K., & Smart, N. P. (2007). Efficient 15,360-bit RSA using woop-optimised montgomery arithmetic. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4887 LNCS, pp. 346–363). Springer Verlag. https://doi.org/10.1007/978-3-540-77272-9_21
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
