Questions tagged [hash-collision]

a situation that occurs when two distinct pieces of data have the same hash value, checksum, fingerprint, or cryptographic digest.

See also the wiki tag.

233 questions
0
votes
0 answers

Hashing and using a doubly-linked list to solve collisions

I'm trying to figure how to append a list value that indexes at the same location in the hash list to the beginning of that hash index. I have the double linked list code and the hashing code that uses the single list chaining method I'm just having…
0
votes
0 answers

Are there any known MD5 collisions for two plain-text ascii strings (not binary data)

There's many MD5 collision examples out there on the web, but as far as I can find, they all involve binary data inputs. Are there any two known plain-text ASCII strings that give the same MD5 hash? Basically I'm building a de-duplication system…
LaVache
  • 2,372
  • 3
  • 24
  • 38
0
votes
1 answer

Are elements of the Hash Table's backing array Linked Lists from the initial point when using Separate Chaining?

For resolving hashing collision in the Hash Table data structure, we have one very popular strategy called Separate Chaining. I'm aware, that in the Separate Chaining strategy, keys, which end up being collided into backing array's same index (due…
Giorgi Tsiklauri
  • 9,715
  • 8
  • 45
  • 66
0
votes
1 answer

I'm using ELF Hash to write a specially tweaked version of hash map. Wanting to produce collisions

Can any one give an example of 2 strings, consisting of alphabetical characters only, that will produce the same hash value with ELFHash? I need these to test my codes. But it doesn't seem like easy to produce. And to my surprise there there are a…
Haozhun
  • 6,331
  • 3
  • 29
  • 50
0
votes
1 answer

Shell BASH---SHA256 Hash Collisions occur in file extraction

I use sha256 hash value to encrypt a password( no matter digit form or char form ). when I unzip the password-protected file, I can use at least two different hash to unzip my file -- it occurs a Hash collision. Although there is no searching point…
Hang Wui
  • 27
  • 5
0
votes
0 answers

How to design a hash function to force specific collisions?

I have a series of hash keys, many of which need to map to the same result. If I know exactly which hash keys need to map where, how can I go about designing a hash function that maximizes these collisions (minimizes necessary table size)? I am…
Hufflet
  • 73
  • 5
0
votes
0 answers

Can we solve a hash table collision, by using a hash table again instead of a linked list?

Instead of using a linked list to avoid collision in hash table, can we use a hash table to avoid collision to obtain result in O(1) time instead of linear time complexity due to linked list?
muditrustagii
  • 743
  • 6
  • 17
0
votes
1 answer

Is the technique for resolving a HashMap hash collision configurable

I was reading about hash-map resolving techniques and in one article the advantages and disadvantages were listed for separate chaining. Who decides which hash collision resolving technique is to be used? Is it purely internal, or is it…
0
votes
1 answer

C++: proper use of HASH and Collision Techniques

Should there be a size limitation on how LARGE a Hash Table may be? I'm a little baffled as I can see why creating too small of a Hash Table should be causing me issues? It appears that too large of a Hash Table is causing my probe to throw a Sig…
0
votes
1 answer

Pillow broke - hash collision: : 22 for both 1 and 1

My Pillow installation is broken system-wide. Either using my OS X pillow version, or other 'isolated' installations within anaconda environments, I always get the same error, while trying to process images: AccessInit: hash collision: 22 for both 1…
8-Bit Borges
  • 9,643
  • 29
  • 101
  • 198
0
votes
0 answers

Why does python3 produce the same hash value for -1 and -2?

I was trying out the python3 in-built hash() method for arbitrary values, then ranges, and I saw something funny: >>> [hash(i) for i in range(-20,20)] [-20, -19, -18, -17, -16, -15, -14, -13, -12, -11, -10, -9, -8, -7, -6, -5, -4, -3, -2, -2, 0, 1,…
axolotl
  • 1,042
  • 1
  • 12
  • 23
0
votes
0 answers

Spring SimpleKey collision?

I just found that SimpleKeyGenerator returns a SimpleKey which concerns method parameters only. Say, what if, following two different service methods have same parameters? @Cacheable long countInAWay(..., ..., ...); @Cacheable long…
Jin Kwon
  • 20,295
  • 14
  • 115
  • 184
0
votes
2 answers

Why does increasing size of hashtable decrease the number of collisions?

From what I have read online, there are two ways of decreasing the number of collisions: Use a better hash function Increase the size of your hashtable I can understand the first reason but I cannot seem to get my head around the second. If lets…
Core_Dumped
  • 4,577
  • 11
  • 47
  • 71
0
votes
3 answers

Handle Collision using Hashtable Class in c#

In the below scenario how can I handle or implement collision in C# using the Hashtable class? If the 'Key' value is same I am getting an "Argument Exception". static void Main(string[] args) { Console.Write("Enter a string:"); …
Prakazz
  • 421
  • 1
  • 8
  • 21
0
votes
2 answers

One way functions, Hash algorithms

Basically One-way functions have two properties: 1. Irreversible 2. Collision-Resistance(which means no two same words have the same hash value correct me if im wrong) On the other hand i see that Salted Hash Passwords are used to provide more…
Lorik Berisha
  • 243
  • 1
  • 2
  • 20