290 search results - page 34 / 58 » Pseudorandom Bits for Polynomials |
155
click to vote
Publication
Using a trace of address references, we compared the efficiency of several different hashing functions, such as cyclic redundancy checking (CRC) polynomials, Fletcher checksum, fol...
HPCA
2006
IEEE
15 years 10 months ago
2006
IEEE
Hardware counters are a fundamental building block of modern high-performance processors. This paper explores two applications of probabilistic counter updates, in which the outpu...
SOUPS
2009
ACM
15 years 4 months ago
2009
ACM
Randomness is a necessary ingredient in various computational tasks and especially in Cryptography, yet many existing mechanisms for obtaining randomness suffer from numerous pro...
ICASSP
2008
IEEE
15 years 4 months ago
2008
IEEE
We present a novel video fingerprinting method based on subspace embedding. The proposed method is particularly robust against frame-rate conversion attacks and geometric attacks...
VTC
2008
IEEE
15 years 4 months ago
2008
IEEE
— In this paper, we introduce and outline the concept of Channel Code Division Multiple Access (CCDMA) using a design example based on the recently proposed Multilevel Structured...