434 search results - page 10 / 87 » Logical Analysis of Hash Functions |
CRYPTO
2011
Springer
14 years 11 days ago
2011
Springer
We prove that Tandem-DM, one of the two “classical” schemes for turning a blockcipher of 2n-bit key into a double block length hash function, has birthday-type collision resist...
110
Voted
ICFP
2005
ACM
16 years 16 days ago
2005
ACM
We present a compositional program logic for call-by-value imperative higher-order functions with general forms of aliasing, which can arise from the use of reference names as fun...
100
Voted
ISVC
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. The function of a protein is dependent on whether and how it can interact with various ligands. Therefore, an accurate prediction of protein-ligand interactions is paramo...
106
click to vote
ECCC
2011
14 years 7 months ago
2011
A fundamental fact in the analysis of randomized algorithm is that when n balls are hashed into n bins independently and uniformly at random, with high probability each bin contai...
FSE
2008
Springer
15 years 2 months ago
2008
Springer
We propose SWIFFT, a collection of compression functions that are highly parallelizable and admit very efficient implementations on modern microprocessors. The main technique under...