9 search results - page 2 / 2 » Pseudorandom Bit Generators That Fool Modular Sums |
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Abstract--We investigate the problem of maintaining an encoded distributed storage system when some nodes contain adversarial errors. Using the error-correction capabilities that a...
TC
2008
13 years 4 months ago
2008
Since redundant number systems allow for constant time addition, they are often at the heart of modular multipliers designed for public key cryptography (PKC) applications. Indeed,...
ASIACRYPT
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. Stream ciphers play an important role in symmetric cryptology because of their suitability in high speed applications where block ciphers fall short. A large number of fa...
SODA
2010
ACM
14 years 2 months ago
2010
ACM
We settle the 1-pass space complexity of (1 ? )approximating the Lp norm, for real p with 1 p 2, of a length-n vector updated in a length-m stream with updates to its coordinate...