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

Authors:
Kamel Bentahar;Nigel P. Smart
Affiliations:
Department of Computer Science, University of Bristol, Bristol, United Kingdom;Department of Computer Science, University of Bristol, Bristol, United Kingdom
Venue:
Cryptography and Coding'07 Proceedings of the 11th IMA international conference on Cryptography and coding
Year:
2007

Citing 7
Cited 2

A survey of fast exponentiation methods

Journal of Algorithms
Handbook of Applied Cryptography

Handbook of Applied Cryptography
More on Squaring and Multiplying Large Integers

IEEE Transactions on Computers
Practical Cryptography

Practical Cryptography
Fast Modular Reduction for Large Wordlengths via One Linear and One Cyclic Convolution

ARITH '05 Proceedings of the 17th IEEE Symposium on Computer Arithmetic
Energy-efficient software implementation of long integer modular arithmetic

CHES'05 Proceedings of the 7th international conference on Cryptographic hardware and embedded systems
Fast truncated multiplication for cryptographic applications

CHES'05 Proceedings of the 7th international conference on Cryptographic hardware and embedded systems

Securing cloud-based computations against malicious providers

ACM SIGOPS Operating Systems Review
Securing cloud-based computations against malicious providers

Proceedings of the 1st European Workshop on Dependable Cloud Computing

Quantified Score

Hi-index	0.00

Visualization

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.