Sciweavers

17 search results - page 2 / 4
» A bound on the size of separating hash families
Sort
View
CRYPTO
2011
Springer
222views Cryptology» more  CRYPTO 2011»
12 years 5 months ago
The PHOTON Family of Lightweight Hash Functions
RFID security is currently one of the major challenges cryptography has to face, often solved by protocols assuming that an on-tag hash function is available. In this article we pr...
Jian Guo 0001, Thomas Peyrin, Axel Poschmann
STACS
2001
Springer
13 years 10 months ago
New Bounds on the OBDD-Size of Integer Multiplication via Universal Hashing
Abstract. Ordered binary decision diagrams (OBDDs) nowadays belong to the most common representation types for Boolean functions. Although they allow important operations such as s...
Philipp Woelfel
CORR
2010
Springer
136views Education» more  CORR 2010»
13 years 5 months ago
Maximum Bipartite Matching Size And Application to Cuckoo Hashing
Cuckoo hashing with a stash is a robust high-performance hashing scheme that can be used in many real-life applications. It complements cuckoo hashing by adding a small stash stor...
Josef Kanizo, David Hay, Isaac Keslassy
ICDCSW
2003
IEEE
13 years 11 months ago
Foundations of Security for Hash Chains in Ad Hoc Networks
Nodes in ad hoc networks generally transmit data at regular intervals over long periods of time. Recently, ad hoc network nodes have been built that run on little power and have v...
Phillip G. Bradford, Olga V. Gavrylyako
SOFSEM
2009
Springer
14 years 2 months ago
Weaknesses of Cuckoo Hashing with a Simple Universal Hash Class: The Case of Large Universes
Cuckoo hashing was introduced by Pagh and Rodler in 2001 [12]. A set S of n keys is stored in two tables T1 and T2 each of which has m cells of capacity 1 such that constant access...
Martin Dietzfelbinger, Ulf Schellbach