Sciweavers

101 search results - page 1 / 21
» Exact Analysis of Montgomery Multiplication
Sort
View
INDOCRYPT
2004
Springer
13 years 10 months ago
Exact Analysis of Montgomery Multiplication
The Montgomery multiplication is often used for an efficient implementations of public-key cryptosystems. This algorithm occasionally needs an extra subtraction in the final step,...
Hisayoshi Sato, Daniel Schepers, Tsuyoshi Takagi
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...
ISCAS
2007
IEEE
176views Hardware» more  ISCAS 2007»
13 years 11 months ago
SPA against an FPGA-Based RSA Implementation with a High-Radix Montgomery Multiplier
— Simple Power Analysis (SPA) was applied to an RSA processor with a high-radix Montgomery multiplier on an FPGA platform, and the different characteristics of power waveforms ca...
Atsushi Miyamoto, Naofumi Homma, Takafumi Aoki, Ak...
CORR
2004
Springer
117views Education» more  CORR 2004»
13 years 4 months ago
Efficient dot product over word-size finite fields
We want to achieve efficiency for the exact computation of the dot product of two vectors over word size finite fields. We therefore compare the practical behaviors of a wide range...
Jean-Guillaume Dumas
ICC
2007
IEEE
111views Communications» more  ICC 2007»
13 years 11 months ago
Exact Multiple Access Analysis for Pulsed DS-UWB Systems with Episodic Transmission in Flat Nakagami Fading
— Exact bit error probabilities (BEP) are derived in closed form for pulsed binary direct sequence ultra-wideband (DS-UWB) multiple access systems in flat Nakagami fading channe...
Mohammad Azizur Rahman, Shigenobu Sasaki, Hisakazu...