183 search results - page 9 / 37 » The State of Cryptographic Hash Functions |
MATA
2004
Springer
14 years 25 days ago
2004
Springer
Abstract. Limited computational power imposes new challenges during the implementation of security and privacy solutions for mobile devices. The choice for the most appropriate cry...
FSE
2007
Springer
14 years 1 months ago
2007
Springer
In this paper we propose the Grindahl hash functions, which are based on components of the Rijndael algorithm. To make collision search sufficiently difficult, this design has the...
ACNS
2006
Springer
14 years 1 months ago
2006
Springer
We study the influence of collision-finding attacks on the security of time-stamping schemes. We distinguish between client-side hash functions used to shorten the documents befo...
ACISP
2008
Springer
14 years 1 months ago
2008
Springer
LAKE is a family of cryptographic hash functions presented at FSE 2008. It is an iterated hash function and defines two main instances with a 256 bit and 512 bit hash value. In th...
CTRSA
2011
Springer
12 years 11 months ago
2011
Springer
Non-malleability of a cryptographic primitive is a fundamental security property which ensures some sort of independence of cryptographic values. The notion has been extensively st...