Sciweavers

317 search results - page 1 / 64
» A Scalable Architecture for Montgomery Multiplication
Sort
View
DATE
2010
IEEE
125views Hardware» more  DATE 2010»
13 years 10 months ago
pSHS: A scalable parallel software implementation of Montgomery multiplication for multicore systems
—Parallel programming techniques have become one of the great challenges in the transition from single-core to multicore architectures. In this paper, we investigate the parallel...
Zhimin Chen, Patrick Schaumont
CHES
1999
Springer
104views Cryptology» more  CHES 1999»
13 years 9 months ago
A Scalable Architecture for Montgomery Multiplication
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 mu...
Alexandre F. Tenca, Çetin Kaya Koç
GLVLSI
2007
IEEE
166views VLSI» more  GLVLSI 2007»
13 years 9 months ago
Efficient pipelining for modular multiplication architectures in prime fields
This paper presents a pipelined architecture of a modular Montgomery multiplier, which is suitable to be used in public key coprocessors. Starting from a baseline implementation o...
Nele Mentens, Kazuo Sakiyama, Bart Preneel, Ingrid...
CHES
2001
Springer
191views Cryptology» more  CHES 2001»
13 years 9 months ago
A Scalable GF(p) Elliptic Curve Processor Architecture for Programmable Hardware
Abstract. This work proposes a new elliptic curve processor architecture for the computation of point multiplication for curves defined over fields GF(p). This is a scalable arch...
Gerardo Orlando, Christof Paar
CHES
2001
Springer
124views Cryptology» more  CHES 2001»
13 years 9 months ago
High-Radix Design of a Scalable Modular Multiplier
This paper describes an algorithm and architecture based on an extension of a scalable radix-2 architecture proposed in a previous work. The algorithm is proven to be correct and t...
Alexandre F. Tenca, Georgi Todorov, Çetin K...