109 search results - page 8 / 22 » Analysis of All-or-Nothing Hash Functions |
130
click to vote
CSFW
2012
IEEE
13 years 2 months ago
2012
IEEE
—In this paper, we propose a formal analysis of domain extenders for hash functions in the indifferentiability framework. We define a general model for domain extenders and prov...
113
Voted
FMCAD
2004
Springer
15 years 4 months ago
2004
Springer
Abstract. Probabilistic techniques for verification of finite-state transition systems offer huge memory savings over deterministic techniques. The two leading probabilistic scheme...
110
Voted
ACISP
2010
Springer
14 years 10 months ago
2010
Springer
Many applications using cryptographic hash functions do not require collision resistance, but some kind of preimage resistance. That's also the reason why the widely used SHA-...
107
click to vote
TALG
2008
15 years 10 days ago
2008
Abstract. We present a new analysis of the well-known family of multiplicative hash functions, and improved deterministic algorithms for selecting "good" hash functions. ...
ACISP
2009
Springer
15 years 7 months ago
2009
Springer
Bernstein’s CubeHash is a hash function family that includes four functions submitted to the NIST Hash Competition. A CubeHash function is parametrized by a number of rounds r, a...