Sciweavers

1449 search results - page 44 / 290
» Self-Randomized Exponentiation Algorithms
Sort
View
115
Voted
EUROCRYPT
2000
Springer
15 years 4 months ago
Cox-Rower Architecture for Fast Parallel Montgomery Multiplication
Abstract. This paper proposes a fast parallel Montgomery multiplication algorithm based on Residue Number Systems (RNS). It is easy to construct a fast modular exponentiation by ap...
Shin-ichi Kawamura, Masanobu Koike, Fumihiko Sano,...
EOR
2007
101views more  EOR 2007»
15 years 14 days ago
Optimizing an objective function under a bivariate probability model
The motivation of this paper is to obtain an analytical closed form of a quadratic objective function arising from a stochastic decision process with bivariate exponential probabi...
Xavier Brusset, Nico M. Temme
108
Voted
WAIFI
2007
Springer
141views Mathematics» more  WAIFI 2007»
15 years 6 months ago
New Point Addition Formulae for ECC Applications
Abstract. In this paper we propose a new approach to point scalar multiplication on elliptic curves defined over fields of characteristic greater than 3. It is based on new point...
Nicolas Meloni
83
Voted
GLOBECOM
2009
IEEE
15 years 4 months ago
Internet Service Tiering as a Market Segmentation Strategy
We consider Internet broadband access as an elastic service whose value varies across segments of the user population. We show that introducing multiple tiers of service can be an ...
Qian Lv, George N. Rouskas
112
Voted
ECCC
2000
93views more  ECCC 2000»
15 years 10 days ago
Security of the Most Significant Bits of the Shamir Message Passing Scheme
Boneh and Venkatesan have recently proposed a polynomial time algorithm for recovering a "hidden" element of a finite field Fp of p elements from rather short strings of...
Maria Isabel Gonzalez Vasco, Igor Shparlinski