2157 search results - page 65 / 432 » Optimal Fast Hashing |
113
click to vote
ICCD
1993
IEEE
15 years 8 months ago
1993
IEEE
In this paper the design of a high-speed cryptographic coprocessor is presented. This coprocessor is named Subterranean and can be used for both cryptographic pseudorandom sequenc...
175
click to vote
CODCRY
2011
Springer
14 years 7 months ago
2011
Springer
Fix positive integers B and w. Let C be a linear code over F2 of length Bw. The 2-regular-decoding problem is to find a nonzero codeword consisting of w length-B blocks, each of w...
180
click to vote
FSE
2011
Springer
14 years 7 months ago
2011
Springer
Hamsi is one of the 14 second-stage candidates in NIST’s SHA-3 competition. The only previous attack on this hash function was a very marginal attack on its 256-bit version publi...
153
click to vote
INFOCOM
2012
IEEE
13 years 6 months ago
2012
IEEE
—Counting Bloom Filters (CBFs) are widely used in networking device algorithms. They implement fast set representations to support membership queries with limited error, and supp...
126
Voted
IWMM
2007
Springer
15 years 10 months ago
2007
Springer
Numerous optimizations exist for improving the performance of nondeferred reference-counting (RC) garbage collection. Their designs are ad hoc, intended to exploit different count...