Efficient 15,360-bit RSA using woop-optimised montgomery arithmetic

Kamel Bentahar, Nigel P. Smart

Research output: Chapter in Book/Report/Conference proceedingConference proceeding

1 Citation (Scopus)

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.

Original languageEnglish
Title of host publicationCryptography and Coding - 11th IMA International Conference, Proceedings
PublisherSpringer
Pages346-363
Number of pages18
Volume4887 LNCS
ISBN (Print)9783540772712
DOIs
Publication statusPublished - 2007
Externally publishedYes
Event11th IMA Conference on Cryptography and Coding - Cirencester, United Kingdom
Duration: 18 Dec 200720 Dec 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4887 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Conference

Conference11th IMA Conference on Cryptography and Coding
CountryUnited Kingdom
CityCirencester
Period18/12/0720/12/07

    Fingerprint

Bibliographical note

This paper is not available in Pure.

ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Cite this

Bentahar, K., & Smart, N. P. (2007). Efficient 15,360-bit RSA using woop-optimised montgomery arithmetic. In Cryptography and Coding - 11th IMA International Conference, Proceedings (Vol. 4887 LNCS, pp. 346-363). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4887 LNCS). Springer. https://doi.org/10.1007/978-3-540-77272-9_21