a computationally efficient function mapping binary strings or arbitrary length to binary strings of some fixed length, called hash-values
a cryptographic function for which it is supposed to be hard to find two inputs that produce the same output
a form of encryption that takes some plaintext input and transforms it into a fixed-length encrypted output called the message digest
a function on a given type which returns an integer, which can then be used as an index into an array
a function that converts an input from a (typically) large domain into an output in a (typically)
a function thatconverts an input from a (typically) large domain into an output in a(typically) smaller range (the hash value , often a subset of the integers )
a function that does this
a function that maps keys into integers, or to put it more plainly, for a key, supplied as a parameter, returns an integer computed based on some properties of the key
a function which takes a key type and returns an integer which is used to determine the storage location
a function which takes a string as its argument and produces a number, usually a hundred--or-so-bit integer, as its result
a many-to-one function that maps its input to a value in a finite set
a mapping from a set of keys to a range of integers
a mathematical algorithm that reads some input data source, usually a message or some kind of document, and returns a compact binary output that represents the source
a mathematical formula that converts a message of any length into a fixed-length string of digits known as the "hash" that represents the original message
a mathematical function which produces a small string from an input
a mathematical operation that takes an arbitrary input string and creates a (usually) fixed-length hash value, and it is essentially impossible to derive the input string from the hash value
an algorithm applied to a document or file that results in a coded representation of the document
an algorithm that one-way encrypts data
an algorithm that takes a variable-length string as the input and produces a fixed-length binary value (hash) as the output
an algorithm which converts any collection of numbers into a single, distinct number (perhaps of a score or a hundred digits) which has no meaning in itself but which will uniquely represent the set of numbers from which it was derived
an algorithm which creates a digital representation or a "fingerprint" in the form of a "hash value" or a "hash result" of a standard length which is usually much smaller than the message's length but nevertheless substantially unique to it
an approved mathematical function that maps a string of arbitrary length (up to a pre-determined maximum size) to a fixed length string
a numeric function that determines the data block in the cluster based on the value of the cluster key
a one-way function mapping a key (be it numeric or string) to some number that is going to be the bucket number
a one way function that takes a message and reduces it to a unique string
a one way function that takes a variable length input, the pre image, and produces a fixed length output, the hash value
a one-way function that takes some input and quickly computes a digest of the input
a pseudorandom function that is shorter than its input
A function, associated with a table, that computes hash code. All hash functions have one argument, a key, and return two values, a hash id and a hash state, which together represent the hash code. See also equivalence predicate.
A function that maps a variable-length data block or message into a fixed length value called a hash code. The function is designed in such a way that, when protected, it provides an authenticator to the data or message. Also referred to as a direct message digest.
See message digest; message digest function.
A function that takes a variable-length input string and converts it to a fixed-length output string.
A function which assigns a data item distinguished by some "key" into one of a number of bins in a table. Hash functions are frequently used as part of the security layer in a contact-less system. Specifically, hash functions are useful in the key diversification process.
A method used to verify the integrity of a message.
A function that determines which category, or bucket, to put an element in. A hash function is needed when implementing a hash table.
A mathematical function used by the mobile station to select one out of N available resources. The hash function ensures statistically uniform use of the resources.
A mathematical function that maps values from a large (or very large) domain into a smaller range, and that reduces a potentially long message into a "message digest" or "hash value" or that is sufficiently compact to be input into a digital signature algorithm.
A mathematical computation that results in a fixed-length string of bits (digital code) from an arbitrary size input; the function is not reversible to produce the original input.
A function which maps strings of bits to fixed-length strings of bits, satisfying the following two properties: it is computationally infeasable to find for a given output an input which maps to the output; and it is computationally infeasable to find for a given input a second input which maps to the same output.
A hash function is an algorithm that takes a string (or message) of any length as input and produces a fixed-length string as output, Hash functions are used in cryptography for authentication and message integrity. Hash functions are sometimes known as “message digests†or “digital fingerprintsâ€. MD5 and SHA-1 are currently the two most commonly used hash functions. See also: algorithm, Message-Digest algorithm 5 (MD5), Secure Hash Algorithm 1 (SHA-1)
a function which maps a bit string of arbitrary length to a fixed-length bit string and satisifies the following properties: (1) It is computationally infeasible to find any input that maps to any pre-specified output. (2) It is computationally infeasible to find any two distinct inputs that map to the same output.
A one-way function that takes an input message of arbitrary length and produces a fixed-length digest.
Term usually reserved for non-keyed message digests but sometimes is used to refer to both key and non-keyed digest functions.
An algorithm that turns a message of any length into a fixed length message digest. In security, a message digest is used to validate that the contents of a message have not been altered in transit. Examples of a hash function include MD5 or SHA-1, which are used in conjunction with HMAC to provide validation of packet content.
The process of producing hash values for accessing data or for security. A hash value (or simply hash) is a number generated from a string of text. The hash is substantially smaller than the text itself, and is generated by a formula in such a way that it is extremely unlikely that some other text will produce the same hash value.
A formula that is applied to each value of a table column or a combination of several columns, called the key, to get the address of the area in which the row should be stored. When locating data, the database uses the hash function again to get the data's location.
A function that produces a unique value for every unique input message. Hash functions are used when signing and time stamping.
(Also: Hash Algorithm) Function for computing from any input data a cryptographic checksum of given length. For good hash functions it is extremely improbable to retrieve the input data from the hash value or to find different inputs resulting in the same hash value.
A function that takes a variable sized input and has a fixed size output.
A hash function (or hash algorithm) is a reproducible method of turning data (usually a message or a file) into a number suitable to be handled by a computer. These functions provide a way of creating a small digital "fingerprint" from any kind of data. The function chops and mixes (i.e., substitutes or transposes) the data to create the fingerprint, often called a hash value.
