434 search results - page 12 / 87 » Logical Analysis of Hash Functions |
IFIP
1994
Springer
14 years 20 days ago
1994
Springer
TAP
2010
Springer
14 years 1 months ago
2010
Springer
This paper presents techniques for applying a finite relational model finder to logical specifications that involve (co)inductive predicates, (co)algebraic datatypes, and (co)re...
FMCAD
2004
Springer
14 years 9 days 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...
ACISP
2010
Springer
13 years 6 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-...
TALG
2008
13 years 8 months 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. ...