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

Kamel Bentahar; Nigel P. Smart

doi:10.1007/978-3-540-77272-9_21

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

Kamel Bentahar, Nigel P. Smart

University of Bristol

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding › peer-review

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 language	English
Title of host publication	Cryptography and Coding - 11th IMA International Conference, Proceedings
Publisher	Springer
Pages	346-363
Number of pages	18
Volume	4887 LNCS
ISBN (Print)	9783540772712
DOIs	https://doi.org/10.1007/978-3-540-77272-9_21
Publication status	Published - 2007
Externally published	Yes
Event	11th IMA Conference on Cryptography and Coding - Cirencester, United Kingdom Duration: 18 Dec 2007 → 20 Dec 2007

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	4887 LNCS
ISSN (Print)	03029743
ISSN (Electronic)	16113349

Conference

Conference	11th IMA Conference on Cryptography and Coding
Country/Territory	United Kingdom
City	Cirencester
Period	18/12/07 → 20/12/07

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

Access to Document

10.1007/978-3-540-77272-9_21

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

Efficient 15,360-bit RSA using woop-optimised montgomery arithmetic. / Bentahar, Kamel; Smart, Nigel P.
Cryptography and Coding - 11th IMA International Conference, Proceedings. Vol. 4887 LNCS Springer, 2007. p. 346-363 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4887 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding › peer-review

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

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

@inproceedings{7a3250af06bd46a595e79d45e6ea5833,

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

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.",

author = "Kamel Bentahar and Smart, {Nigel P.}",

note = "This paper is not available in Pure.; 11th IMA Conference on Cryptography and Coding ; Conference date: 18-12-2007 Through 20-12-2007",

year = "2007",

doi = "10.1007/978-3-540-77272-9_21",

language = "English",

isbn = "9783540772712",

volume = "4887 LNCS",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer",

pages = "346--363",

booktitle = "Cryptography and Coding - 11th IMA International Conference, Proceedings",

address = "United Kingdom",

}

TY - GEN

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

AU - Bentahar, Kamel

AU - Smart, Nigel P.

N1 - This paper is not available in Pure.

PY - 2007

Y1 - 2007

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=38149123975&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-77272-9_21

DO - 10.1007/978-3-540-77272-9_21

M3 - Conference proceeding

AN - SCOPUS:38149123975

SN - 9783540772712

VL - 4887 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 346

EP - 363

BT - Cryptography and Coding - 11th IMA International Conference, Proceedings

PB - Springer

T2 - 11th IMA Conference on Cryptography and Coding

Y2 - 18 December 2007 through 20 December 2007

ER -

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

Abstract

Publication series

Conference

Bibliographical note

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this