Sciweavers

128 search results - page 14 / 26
» Fast Integer Multiplication using Modular Arithmetic
Sort
View
CHES
2007
Springer
126views Cryptology» more  CHES 2007»
14 years 1 months ago
How to Maximize the Potential of FPGA Resources for Modular Exponentiation
This paper describes a modular exponentiation processing method and circuit architecture that can exhibit the maximum performance of FPGA resources. The modular exponentiation arch...
Daisuke Suzuki
FCCM
2007
IEEE
107views VLSI» more  FCCM 2007»
14 years 1 months ago
Optimizing Logarithmic Arithmetic on FPGAs
This paper proposes optimizations of the methods and parameters used in both mathematical approximation and hardware design for logarithmic number system (LNS) arithmetic. First, ...
Haohuan Fu, Oskar Mencer, Wayne Luk
ARITH
2005
IEEE
14 years 1 months ago
Table Lookup Structures for Multiplicative Inverses Modulo 2k
We introduce an inheritance property and related table lookup structures applicable to simplified evaluation of the modular operations “multiplicative inverse”, “discrete l...
David W. Matula, Alex Fit-Florea, Mitchell Aaron T...
ISCAS
2006
IEEE
107views Hardware» more  ISCAS 2006»
14 years 1 months ago
A versatile computation module for adaptable multimedia processors
—This paper describes a low cost, low power, versatile computation module that can be used as a coarse-grain building block in multimedia processors. The module, which has a data...
Yunan Xiang, R. Pettibon, Martin Margala
ESAS
2007
Springer
14 years 1 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