Encryption topic universal Hash function


If you want to encrypt an message you need encryption key, a list of numbers that tells you how the normal message is transformed into the encrypted message. Sometimes however it is the case that some part of you encryption key is known by someone you want to hide your message from, in that case there are several ways to still secure your message one of which is using a uneversal hash fuction to transform you encryption key into a shorter but more secure key. A universal hash function has the property that the probability that you get the same key out of two different encryption keys is smaller or equal that 1 over the length of the resulting key. One of the easiest examples of an universal hash function is that of a matrix with at random 1 or 0 in every entry.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google photo

You are commenting using your Google account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s