Sciweavers

1262 search results - page 5 / 253
» Fast Robust Hashing
Sort
View
INFOCOM
2009
IEEE
15 years 4 months ago
Robust Counting Via Counter Braids: An Error-Resilient Network Measurement Architecture
—A novel counter architecture, called Counter Braids, has recently been proposed for accurate per-flow measurement on high-speed links. Inspired by sparse random graph codes, Co...
Yi Lu, Balaji Prabhakar
75
Voted
FSE
2005
Springer
113views Cryptology» more  FSE 2005»
15 years 2 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
108
Voted
PKC
1998
Springer
158views Cryptology» more  PKC 1998»
15 years 1 months ago
A Cellular Automaton Based Fast One-Way Hash Function Suitable for Hardware Implementation
One-way hash functions are an important tool in achieving authentication and data integrity. The aim of this paper is to propose a novel one-way hash function based on cellular aut...
Miodrag J. Mihaljevic, Yuliang Zheng, Hideki Imai
SBBD
2008
256views Database» more  SBBD 2008»
14 years 10 months ago
Indexing Internal Memory with Minimal Perfect Hash Functions
A perfect hash function (PHF) is an injective function that maps keys from a set S to unique values, which are in turn used to index a hash table. Since no collisions occur, each k...
Fabiano C. Botelho, Hendrickson R. Langbehn, Guilh...
CCS
2008
ACM
14 years 11 months ago
A fast real-time memory authentication protocol
We propose a new real-time authentication scheme for memory. As in previous proposals the scheme uses a Merkle tree to guarantee dynamic protection of memory. We use the universal...
Yin Hu, Ghaith Hammouri, Berk Sunar