Sciweavers

658 search results - page 10 / 132
» The Grindahl Hash Functions
Sort
View
SCN
2008
Springer
103views Communications» more  SCN 2008»
13 years 7 months ago
Full Cryptanalysis of LPS and Morgenstern Hash Functions
Collisions in the LPS cryptographic hash function of Charles, Goren and Lauter have been found by Z
Christophe Petit, Kristin Lauter, Jean-Jacques Qui...
INFOCOM
2012
IEEE
11 years 9 months ago
Experimental performance comparison of Byzantine Fault-Tolerant protocols for data centers
Abstract—In this paper, we implement and evaluate three different Byzantine Fault-Tolerant (BFT) state machine replication protocols for data centers: (1) BASIC: The classic solu...
Guanfeng Liang, Benjamin Sommer, Nitin H. Vaidya
IJNSEC
2006
81views more  IJNSEC 2006»
13 years 7 months ago
Small Size Hashes with Enhanced Security
This paper contains techniques for enhancing the strength of any cryptographic hash function. For an "ideal", traditional hash function with an m-bit result, the complex...
Lars R. Knudsen
ASIACRYPT
2005
Springer
14 years 28 days ago
A Failure-Friendly Design Principle for Hash Functions
Abstract. This paper reconsiders the established Merkle-Damg˚ard design principle for iterated hash functions. The internal state size w of an iterated n-bit hash function is trea...
Stefan Lucks
FSE
2005
Springer
113views Cryptology» more  FSE 2005»
14 years 27 days ago
SMASH - A Cryptographic Hash Function
1 This paper presents a new hash function design, which is different from the popular designs of the MD4-family. Seen in the light of recent attacks on MD4, MD5, SHA-0, SHA-1, and...
Lars R. Knudsen