<< 2012-3 >>
Department of
Computer Science
 

Efficient 15,360-bit RSA Using Woop-Optimised Montgomery Arithmetic

Kamel Bentahar, Nigel Smart, Efficient 15,360-bit RSA Using Woop-Optimised Montgomery Arithmetic. Cryptography and Coding, pp. 346–363. December 2007. No electronic version available.

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.

Bibtex entry.

Contact details

Publication Admin

© 1995-2013 University of Bristol  |  Terms and Conditions  |  Use of Cookies
About this Page