Translation of "Hashing function" in German

Each subfunction hij can be calculated by means of a hashing function table having a size of

For more information about the hashing function and our security controls, see the Security Controls.

An example of a very simple hashing function:

What hashing function is used for the password?

As noted by the Google Security team, SHA-256 is a safer cryptographic hashing function.

We will use the hashing function so our passwords don't get sent in plain text.

The size of the hashing function table h can be reduced by splitting it into several subfunctions hij so that less storage space is needed.

Careful selection of the hashing function and table size produces a system that does not require additional filtering hardware.

The data collected with this technology is encrypted via a non-backflushable one-way function (hashing).

In place of a direct comparison of data fields, a so-called “hashing” function can also be employed to optimise the comparison process.

Assuming that the client and server both know the user's password, they can verify that the password is the same by using it to apply a hashing function to a one-time bit of information.

The data collected using this technology is encrypted using a non-retrievable one-way function (hashing).

A file can be authenticated by first re-creating the digest using the same hashing function on the original file.

The data collected with this technology are encrypted via a non-backflushable one-way function (hashing).

The output of the multiplexer 5 is connected via a multiplexer output bus 6, at which the hashing function h(w) can be picked up at the end of the search method, to address A0 . . . A7 of a memory 7.

During step 8, a "1" signal at the AND gate output 21 indicates that w is contained in address table T. At the multiplexer output bus 6, the result of the calculation of the hashing function h(w), corresponding to the memory location of the address table T at which a data item identical to search key w is stored, can be picked up.

So to give you an idea of how bad guys go about cracking passwords, they will steal a password file that will have all of the passwords in kind of a scrambled form, called a hash, and so what they'll do is they'll make a guess as to what a password is, run it through a hashing function, and see whether it matches the passwords they have on their stolen password list.

Usually, a cryptographic hash function such as SHA-2 or SHA-3 is used for the hashing.

A checksum could be used as an alternative to such a hash function.

Instead of a hash function, any arbitrary one-way function can be used in the framework of the invention.

In practice, we can use a cryptographic hash function instead.

The requirements to hash functions may basically be expressed in three points:

Compared with customary hash functions the procedure has some advantages:

A Hash Function compresses its input data to a string of constant size.

Get REALbasic encryption, encoding, hashing functions.

In the best case, the hash function distributes the numbers uniformly over all m lists.

The possibility to compare blobs using the Firebird HASH function has been implemented.

Find inputs on which this hash function behaves particularly badly in the above algorithm.

One property of cryptographic hash functions is that this cannot be inverted feasibly.

The hash function reduces the file to a smaller one with a fixed number of bits.

This hash function is a cryptographic hash function with an output of 160 bits.

However, other hash functions can also be employed.

Very preferably, a cryptographic checksum, particularly preferably a hash function is used.