Parallel cryptographic arithmetic using a redundant Montgomery representation

doi:10.1109/TC.2004.100

Parallel cryptographic arithmetic using a redundant Montgomery representation

2004-11-01

18

PRE

AI

DOI：10.1109/TC.2004.100

Original

Original request for help

Save

Abstract

En 中文

We describe how using a redundant Montgomery representation allows for high-performance SIMD-based implementations of RSA and elliptic curve cryptography. This is in addition to the known benefits of immunity from timing attacks afforded by the use of such a representation. We present some preliminary implementation timings using the SSE2 instruction set on a Pentium 4 processor and show that an SIMD parallel implementation of RSA can be around twice as fast as traditional sequential code. This is especially useful given the larger 2,048 bit RSA keys which are now being proposed for standard security levels. Finally, we remark on other application areas that improve the security of our work in the context of side-channel analysis while maintaining high performance.

Keywords:

public key cryptosystems

algorithm design and analysis

parallel and vector implementations

performance measures

Parallel cryptographic arithmetic using a redundant Montgomery representation

Abstract

Journal

Organization