Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

CHES
1999
Springer

favoriteEmaildiscussreport

104views Cryptology» more CHES 1999»

A Scalable Architecture for Montgomery Multiplication

13 years 9 months ago

A Scalable Architecture for Montgomery Multiplication

Download islab.oregonstate.edu

Abstract. This paper describes the methodology and design of a scalable Montgomery multiplication module. There is no limitation on the maximum number of bits manipulated by the multiplier, and the selection of the word-size is made according to the available area and/or desired performance. We describe the general view of the new architecture, analyze hardware organization for its parallel computation, and discuss design tradeoﬀs which are useful to identify the best hardware conﬁguration.

Alexandre F. Tenca, Çetin Kaya Koç

Real-time Traffic

Analyze Hardware Organization | CHES 1999 | Cryptology | Discuss Design Tradeoﬀs | Scalable Montgomery Multiplication |

claim paper

Related Content

» pSHS A scalable parallel software implementation of Montgomery multiplication for multicor...

» Efficient pipelining for modular multiplication architectures in prime fields

» A Scalable GFp Elliptic Curve Processor Architecture for Programmable Hardware

» HighRadix Design of a Scalable Modular Multiplier

» Very High Radix Scalable Montgomery Multipliers

» Scalable VLSI Architecture for GFp Montgomery Modular Inverse Computation

» CoxRower Architecture for Fast Parallel Montgomery Multiplication

» A Compact Architecture for Montgomery Elliptic Curve Scalar Multiplication Processor

» Montgomery Modular Multiplication Algorithm on MultiCore Systems

Post Info
More Details (n/a)

Added	03 Aug 2010
Updated	03 Aug 2010
Type	Conference
Year	1999
Where	CHES
Authors	Alexandre F. Tenca, Çetin Kaya Koç

Comments (0)