Sciweavers

Share
TC
2010
9 years 12 days ago
Faster Interleaved Modular Multiplication Based on Barrett and Montgomery Reduction Methods
This paper proposes two improved interleaved modular multiplication algorithms based on Barrett and Montgomery modular reduction. The algorithms are simple and especially suitable ...
Miroslav Knezevic, Frederik Vercauteren, Ingrid Ve...
FPL
2010
Springer
180views Hardware» more  FPL 2010»
9 years 3 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...
DSD
2006
IEEE
135views Hardware» more  DSD 2006»
9 years 9 months ago
Hardware-Software Codesign of a Vector Co-processor for Public Key Cryptography
Until now, most cryptography implementations on parallel architectures have focused on adapting the software to SIMD architectures initially meant for media applications. In this ...
Jacques J. A. Fournier, Simon W. Moore
CHES
2003
Springer
119views Cryptology» more  CHES 2003»
9 years 11 months ago
Faster Double-Size Modular Multiplication from Euclidean Multipliers
Abstract. A novel technique for computing a 2n-bit modular multiplication using n-bit arithmetic was introduced at CHES 2002 by Fischer and Seifert. Their technique makes use of an...
Benoît Chevallier-Mames, Marc Joye, Pascal P...
ARITH
2003
IEEE
9 years 11 months ago
A VLSI Algorithm for Modular Multiplication/Division
We propose an algorithm for modular multiplication/division suitable for VLSI implementation. The algorithm is based on Montgomery’s method for modular multiplication and on the...
Marcelo E. Kaihara, Naofumi Takagi
FPL
2005
Springer
127views Hardware» more  FPL 2005»
9 years 11 months ago
Efficient Hardware Architectures for Modular Multiplication on FPGAs
The computational fundament of most public-key cryptosystems is the modular multiplication. Improving the efficiency of the modular multiplication is directly associated with the...
David Narh Amanor, Viktor Bunimov, Christof Paar, ...
ESAS
2007
Springer
9 years 12 months ago
Enabling Full-Size Public-Key Algorithms on 8-Bit Sensor Nodes
Abstract. In this article we present the fastest known implementation of a modular multiplication for a 160-bit standard compliant elliptic curve (secp160r1) for 8-bit micro contro...
Leif Uhsadel, Axel Poschmann, Christof Paar
ARITH
2007
IEEE
10 years 1 days ago
Modular Multiplication using Redundant Digit Division
Most implementations of the modular exponentiation, ME mod N, computation in cryptographic algorithms employ Montgomery multiplication, ABR−1 mod N, instead of modular multiplic...
Ping Tak Peter Tang
books