Sciweavers

23 search results - page 1 / 5
» A Karatsuba-Based Montgomery Multiplier
Sort
View
FPL
2010
Springer
180views Hardware» more  FPL 2010»
13 years 2 months ago
A Karatsuba-Based Montgomery Multiplier
Abstract--Modular multiplication of long integers is an important building block for cryptographic algorithms. Although several FPGA accelerators have been proposed for large modul...
Gary Chun Tak Chow, Ken Eguro, Wayne Luk, Philip L...
GLVLSI
2007
IEEE
166views VLSI» more  GLVLSI 2007»
13 years 8 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...
IWSOC
2005
IEEE
131views Hardware» more  IWSOC 2005»
13 years 10 months ago
Very High Radix Scalable Montgomery Multipliers
This paper describes a very high radix scalable Montgomery multiplier. It extends the radix-2 Tenca-Koç scalable architecture using w × v – bit integer multipliers in place of...
Kyle Kelley, David Harris
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...
ARITH
2005
IEEE
13 years 10 months ago
An Improved Unified Scalable Radix-2 Montgomery Multiplier
This paper describes an improved version of the Tenca-Koç unified scalable radix-2 Montgomery multiplier with half the latency for small and moderate precision operands and half ...
David Harris, Ram Krishnamurthy, Mark Anders, Sanu...