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.
Translated title of the contribution | Efficient 15,360-bit RSA Using Woop-Optimised Montgomery Arithmetic |
---|---|
Original language | English |
Title of host publication | Cryptography and Coding - IMACC 2007 |
Publisher | Springer Berlin Heidelberg |
Pages | 346-363 |
Volume | 4887 |
Publication status | Published - 2007 |
Bibliographical note
Other page information: 346-363Conference Proceedings/Title of Journal: Cryptography and Coding
Other identifier: 2000774