Parallel cryptographic arithmetic using a redundant Montgomery representation

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

Full description

Bibliographic Details

Published in:	IEEE transactions on computers Vol. 53; no. 11; pp. 1474 - 1482
Main Authors:	Page, D., Smart, N.P.
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.11.2004 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	algorithm design and analysis Computer instructions Index Terms- Public key cryptosystems parallel and vector implementations Parallel processing performance measures Pipeline arithmetic Public key cryptography
ISSN:	0018-9340, 1557-9956
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!