Sciweavers

61 search results - page 6 / 13
» Arbitrary Bit Permutations in One or Two Cycles
Sort
View
ESA
2009
Springer
149views Algorithms» more  ESA 2009»
14 years 1 months ago
3.5-Way Cuckoo Hashing for the Price of 2-and-a-Bit
The study of hashing is closely related to the analysis of balls and bins; items are hashed to memory locations much as balls are thrown into bins. In particular, Azar et. al. [2] ...
Eric Lehman, Rina Panigrahy
CRYPTO
2004
Springer
120views Cryptology» more  CRYPTO 2004»
14 years 11 days ago
Round-Optimal Secure Two-Party Computation
Abstract. We consider the central cryptographic task of secure twoparty computation, where two parties wish to compute some function of their private inputs (each receiving possibl...
Jonathan Katz, Rafail Ostrovsky
P2P
2010
IEEE
113views Communications» more  P2P 2010»
13 years 5 months ago
Unraveling BitTorrent's File Unavailability: Measurements and Analysis
—BitTorrent suffers from one fundamental problem: the long-term availability of content. This occurs on a massivescale with 38% of torrents becoming unavailable within the first...
Sebastian Kaune, Rubén Cuevas Rumín,...
ACSAC
2000
IEEE
13 years 11 months ago
The Chinese Remainder Theorem and its Application in a High-Speed RSA Crypto Chip
The performance of RSA hardware is primarily determined by an efficient implementation of the long integer modular arithmetic and the ability to utilize the Chinese Remainder The...
Johann Großschädl
FPL
2008
Springer
111views Hardware» more  FPL 2008»
13 years 8 months ago
Sampling from the exponential distribution using independent Bernoulli variates
The exponential distribution is a key distribution in many event-driven Monte-Carlo simulations, where it is used to model the time between random events in the system. This paper...
David B. Thomas, Wayne Luk