Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with hash-functions
Search options not deleted
user 17939
An surjective function that maps a set of keys to a smaller data sets of a fixed length. Cryptographic hash-function are supposed to be practically impossible to reverse except by brute-force.
0
votes
2
answers
211
views
Identifying a very weak hash algorithm
I'm reverse-engineering a string translation file format for a particular game. It's ultimately just an ID-to-string map, where the IDs are four-byte integers. There are 1935 IDs in total; you can see …
- 111
1
vote
Accepted
Identifying a very weak hash algorithm
I actually found the hash function today by reverse-engineering the game's code. Here it is, translated to Python:
def hashFunction(data):
h = -1
for c in data:
if (c - 65) & 0xFFFFF …
- 111