658 search results - page 63 / 132 » The Grindahl Hash Functions |
121
click to vote
CODCRY
2011
Springer
14 years 1 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...
114
click to vote
FSE
2011
Springer
14 years 1 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...
IACR
2011
13 years 9 months ago
2011
The Keccak hash function is one of the five finalists in NIST’s SHA-3 competition, and so far it showed remarkable resistance against practical collision finding attacks: Afte...
111
click to vote
SIGCOMM
2012
ACM
13 years 8 days ago
2012
ACM
A fundamental problem in wireless networks is to develop communication protocols that achieve high throughput in the face of noise, interference, and fading, all of which vary wit...
CRYPTO
2012
Springer
13 years 7 days ago
2012
Springer
Liskov, Rivest and Wagner formalized the tweakable blockcipher (TBC) primitive at CRYPTO’02. The typical recipe for instantiating a TBC is to start with a blockcipher, and then b...