1262 search results - page 69 / 253 » Fast Robust Hashing |
87
Voted
ICCD
1993
IEEE
15 years 5 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...
99
Voted
IJNSEC
2008
15 years 24 days ago
2008
Security is a critical design issue in Mobile IPv6 since adversaries can take advantage of its routing process and arbitrarily channelize the traffic to different destinations. Th...
140
Voted
CODCRY
2011
Springer
14 years 4 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...
144
Voted
FSE
2011
Springer
14 years 4 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...
134
Voted
INFOCOM
2012
IEEE
13 years 3 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...