Sciweavers

658 search results - page 10 / 132
» The Grindahl Hash Functions
Sort
View
95
Voted
SCN
2008
Springer
103views Communications» more  SCN 2008»
15 years 20 days 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...
119
Voted
INFOCOM
2012
IEEE
13 years 3 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
98
Voted
IJNSEC
2006
81views more  IJNSEC 2006»
15 years 22 days 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
114
Voted
ASIACRYPT
2005
Springer
15 years 6 months 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
102
Voted
FSE
2005
Springer
113views Cryptology» more  FSE 2005»
15 years 6 months 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