Sciweavers

658 search results - page 40 / 132
» The Grindahl Hash Functions
Sort
View
GLOBECOM
2007
IEEE
15 years 4 months ago
A Hash Function Scheme for Key Management in UMTS MBMS
—3GPP 33.246 proposes Key Management Mechanism (KMM) to distribute security keys for Universal Mobile Telecommunications System (UMTS) Multimedia Broadcast and Multicast Service ...
Shin-Ming Cheng, Wei-Ru Lai, Phone Lin
ACNS
2007
Springer
165views Cryptology» more  ACNS 2007»
15 years 3 months ago
Tweaking TBE/IBE to PKE Transforms with Chameleon Hash Functions
We present two transforms to acquire chosen ciphertext security from tag based techniques. The first one requires the separability of underlying primitives. By separability, info...
Rui Zhang 0002
CRYPTO
2004
Springer
108views Cryptology» more  CRYPTO 2004»
15 years 3 months ago
Finding Collisions on a Public Road, or Do Secure Hash Functions Need Secret Coins?
Many cryptographic primitives begin with parameter generation, which picks a primitive from a family. Such generation can use public coins (e.g., in the discrete-logarithm-based c...
Chun-Yuan Hsiao, Leonid Reyzin
JCST
2007
97views more  JCST 2007»
14 years 9 months ago
Improved Collision Attack on Hash Function MD5
In this paper, we present a fast attack algorithm to find two-block collision of hash function MD5. The algorithm is based on the two-block collision differential path of MD5 that ...
Jie Liang, Xue-Jia Lai
GLOBECOM
2008
IEEE
14 years 10 months ago
Blooming Trees for Minimal Perfect Hashing
Abstract—Hash tables are used in many networking applications, such as lookup and packet classification. But the issue of collisions resolution makes their use slow and not suit...
Gianni Antichi, Domenico Ficara, Stefano Giordano,...