What is the translation of " THE HASH FUNCTION " in Chinese?

• 哈希函数
• 散列函数

Examples of using The hash function in English and their translations into Chinese

In general, the hash function Hk is defined as:.
通常，哈希函数Hk的定义如下：.

And that is the job of the hash function.
这就是哈希函数发挥作用的地方。

The hash function needs to meet two security requirements:.
Hashfunction需要满足以下两个条件：.

As we stated earlier, if the hash function is perfect, collisions will never occur.
我们前面说过的，如果哈希函数是完美的，不会发生冲突。

The hash function should be capable of returning the hash of input quickly.
哈希函数应该能够快速返回输入的哈希。

Different input strings will usually produce different hashes(depending on the hash function).
不同的输入字符串一般会产生不同的输出散列值(取决于hash函数)。

This way the hash function covers all your hash space uniformly.
这样，哈希函数统一覆盖了所有哈希空间。

If such complexity is the best that can be achieved by an adversary, then the hash function is considered preimage-resistant.
若这种复杂度最佳且可被被攻击者达到，这种哈希函数就被认为是抗原像的。

It is the hash function algorithm of NSA which was first published in 2001.
它是一种NSA哈希函数算法，首次发布于2001年。

It's not random- every time you put in that particular data set through the hash function, you will get the same 64-character string.
它不是随机的-每次你放入特定的数据集通过哈希函数，你会得到相同的64字串。

The hash functions used in a Bloom filter should be independent and uniformly distributed.
布隆过滤器中使用的散列函数应该是独立且均匀分布的。

The fixed bit length can vary(like 32-bit or 64-bit or 128-bit or 256-bit) depending on the hash function which is being used.
固定位长度可以变化（如32位或64位或128位或256位），具体取决于所使用的散列函数。

If the Hash function creates enough small-sized buckets then the time complexity is O(M+N).
如果哈希函数创建足够小的桶，那么，时间复杂度就是O(M+N)。

It's not random- every time you put in that particular data set through the hash function, you will get the same 64-character string.
它不是随机的--每次你通过哈希函数输入特定的数据集，你会得到相同的64字符字符串。

For every call to the hash function, and in practice you can just look it up in a standards document.
这个数字被重复使用到哈希函数的每一个调用中，实际上你可以在标准文档中查找到。

As for the information in the ledger, the timestamping scheme is Proof of work and the hash function works with scrypt.
至于分类账信息，时间戳方案是工作证明，并且散列函数与scrypt一起工作。

The more complex the hash function, the more secure it is, but the slower it is to encrypt.
哈希函数越复杂，它越安全，但加密越慢。

This hash is not random because every time you plug in that particular data set through the hash function, you will see the same 64-character string.
它不是随机的-每次你放入特定的数据集通过哈希函数，你会得到相同的64字串。

With complex objects, the hash function is typically not applied to the whole object, but to a key instead.
对于复杂的对象，hash函数通常不适用于整个对象，用key来代替。

The hash functions that are used in various security related applications are called cryptographic hash functions..
在安全应用中使用的Hash函数称为密码学Hash函数。

Summation process is called hashing, the method itself is the hash function and the resulting number is a hash sum or simply hash..
求和过程被称为哈希，方法本身是hash函数而其结果数字为一个hash和或仅为hash。

The hash function may also take multiple inputs, which mean you can get a random number for a given 2D or 3D coordinate:.
哈希函数也可以接收多个输入，也就是说您可以按照给定的2D或3D坐标来获取随机数:.

But, if you don't take care of the hash function of the key, you might end up with very slow put() and get() calls.
但是，如果不注意键的哈希函数，则最终你可能在执行put()和get()时十分缓慢。

Thus the hash functions application in blockchain is to guarantee the integrity of the whole chain of transactions.
因此，哈希值函数在区块链中的应用是为了保证整个事务链的完整性。

Miners rerun the hash function until one of them generates a hash value that matches the specified target.
矿工们会一直重新运行哈希函数，直到其中一个矿工生成的哈希值与目标值相符。

The hash function's result cannot be determined in advance, nor can a pattern be created that will produce a specific hash value.
哈希函数的结果无法提前得知，也没有能得到一个特定哈希值的模式。

The hash function is perfect, which means that the hash table has no collisions, and the hash table lookup needs a single string comparison only.
哈希函数是完美的，这意味着哈希表没有冲突，并且哈希表的查找只需要一次字符串比较。

This requires that the hash function is collision-resistant, which means that it is very hard to find data that will generate the same hash value.
这需要散列函数是抗碰撞(collision-resistant)的，意味着很难找到产生相同散列值的数据。

Solutions which update the hash function any time the set is modified are known as dynamic perfect hashing, but these methods are relatively complicated to implement.
每次集合S被修改后自动更新hash函数的解决方案被称为dynamicperfecthashing，但这类方法非常复杂，难以实现。

The hashing function used in IOTA is called Curl.
IOTA中使用的哈希函数称为Curl。