Sciweavers

2157 search results - page 25 / 432
» Optimal Fast Hashing
Sort
View
SACRYPT
2007
Springer
151views Cryptology» more  SACRYPT 2007»
15 years 8 months ago
Collisions for 70-Step SHA-1: On the Full Cost of Collision Search
The diversity of methods for fast collision search in SHA-1 and similar hash functions makes a comparison of them difficult. The literature is at times very vague on this issue, wh...
Christophe De Cannière, Florian Mendel, Chr...
SIGMOD
2010
ACM
324views Database» more  SIGMOD 2010»
15 years 6 months ago
Similarity search and locality sensitive hashing using ternary content addressable memories
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...
Rajendra Shinde, Ashish Goel, Pankaj Gupta, Debojy...
SIGMETRICS
2003
ACM
119views Hardware» more  SIGMETRICS 2003»
15 years 7 months ago
Incrementally improving lookup latency in distributed hash table systems
Distributed hash table (DHT) systems are an important class of peer-to-peer routing infrastructures. They enable scalable wide-area storage and retrieval of information, and will ...
Hui Zhang 0002, Ashish Goel, Ramesh Govindan
INDOCRYPT
2001
Springer
15 years 6 months ago
Mobile Agent Route Protection through Hash-Based Mechanisms
Abstract. One approach to secure mobile agent execution is restricting the agent route to trusted environments. A necessary condition for this approach to be practical is that the ...
Josep Domingo-Ferrer
IACR
2011
106views more  IACR 2011»
14 years 1 months ago
Hash Functions Based on Three Permutations: A Generic Security Analysis
We consider the family of 2n-to-n-bit compression functions that are solely based on at most three permutation executions and on XOR-operators, and analyze its collision and preima...
Bart Mennink, Bart Preneel