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.
|Title of host publication
|Cryptography and Coding - 11th IMA International Conference, Proceedings
|Number of pages
|Published - 2007
|11th IMA Conference on Cryptography and Coding - Cirencester, United Kingdom
Duration: 18 Dec 2007 → 20 Dec 2007
|Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
|11th IMA Conference on Cryptography and Coding
|18/12/07 → 20/12/07
Bibliographical noteThis paper is not available in Pure.
ASJC Scopus subject areas
- Computer Science(all)
- Biochemistry, Genetics and Molecular Biology(all)
- Theoretical Computer Science