A function where small changes in input always result in large changes in output

Question

I would like an algorithm for a function that takes n integers and returns one integer. For small changes in the input, the resulting integer should vary greatly. Even though I've taken a number of courses in math, I have not used that knowledge very much and now I need some help...

An important property of this function should be that if it is used with coordinate pairs as input and the result is plotted (as a grayscale value for example) on an image, any repeating patterns should only be visible if the image is very big.

I have experimented with various algorithms for pseudo-random numbers with little success and finally it struck me that md5 almost meets my criteria, except that it is not for numbers (at least not from what I know). That resulted in something like this Python prototype (for n = 2, it could easily be changed to take a list of integers of course):

import hashlib
def uniqnum(x, y):
    return int(hashlib.md5(str(x) + ',' + str(y)).hexdigest()[-6:], 16)

But obviously it feels wrong to go over strings when both input and output are integers. What would be a good replacement for this implementation (in pseudo-code, python, or whatever language)?

Answer 1

A "hash" is the solution created to solve exactly the problem you are describing. See wikipedia's article

Any hash function you use will be nice; hash functions tend to be judged based on these criteria:

• The degree to which they prevent collisions (two separate inputs producing the same output) -- a by-product of this is the degree to which the function minimizes outputs that may never be reached from any input.
• The uniformity the distribution of its outputs given a uniformly distributed set of inputs
• The degree to which small changes in the input create large changes in the output.

(see perfect hash function)

Given how hard it is to create a hash function that maximizes all of these criteria, why not just use one of the most commonly used and relied-on existing hash functions there already are?

From what it seems, turning integers into strings almost seems like another layer of encryption! (which is good for your purposes, I'd assume)

However, your question asks for hash functions that deal specifically with numbers, so here we go.

---

Hash functions that work over the integers

If you want to borrow already-existing algorithms, you may want to dabble in pseudo-random number generators

One simple one is the middle square method:

• Take a digit number
• Square it
• Chop off the digits and leave the middle digits with the same length as your original.

ie,

1111 => 01234321 => 2342

so, 1111 would be "hashed" to 2342, in the middle square method.

This way isn't that effective, but for a few number of hashes, this has very low collision rates, a uniform distribution, and great chaos-potential (small changes => big changes). But if you have many values, time to look for something else...

The grand-daddy of all feasibly efficient and simple random number generators is the (Mersenne Twister)[http://en.wikipedia.org/wiki/Mersenne_twister]. In fact, an implementation is probably out there for every programming language imaginable. Your hash "input" is something that will be called a "seed" in their terminology.

In conclusion

1. Nothing wrong with string-based hash functions
2. If you want to stick with the integers and be fancy, try using your number as a seed for a pseudo-random number generator.

Answer 2

Hashing fits your requirements perfectly. If you really don't want to use strings, find a Hash library that will take numbers or binary data. But using strings here looks OK to me.