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

Celý popis

Podrobná bibliografia

Vydané v:	IEEE transactions on computers Ročník 53; číslo 11; s. 1474 - 1482
Hlavní autori:	Page, D., Smart, N.P.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York IEEE 01.11.2004 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!