95 search results - page 5 / 19 » Fast Multiparty Multiplications from shared bits |
CORR
2010
Springer
14 years 11 months ago
2010
Springer
Despite the tremendous success of BitTorrent, its swarming system suffers from a fundamental limitation: lower or no availability of unpopular contents. Recently, Menasche et al. ...
IJNSEC
2008
14 years 11 months ago
2008
The nature of the RSA public modulus N as a composite of at least two secret large primes was always considered as a major obstacle facing the RSA function sharing without the hel...
107
click to vote
EUROCRYPT
2000
Springer
15 years 2 months ago
2000
Springer
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...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We characterize the capacity region to within 2 bits/s/Hz and the symmetric capacity to within 1 bit/s/Hz for the two-user Gaussian interference channel (IC) with feedback. We dev...
INFOCOM
2011
IEEE
14 years 2 months ago
2011
IEEE
Abstract – There is a growing interest in physical layer security. Recent work has demonstrated that wireless devices can generate a shared secret key by exploiting variations in...