The 128-bit hash result is represented as a string of 32 hex digits.
位散列结果被表示为32个十六进位数字组成的字符串。
As a result, the hash codes are guaranteed to be stable.
结果就是哈希码保证是稳定的。
In 0.21 seconds, the first result is "Google Hash: md5(foobar) = 3858f62230ac3c915f300c664312c63f".
秒内，第一个结果是“GoogleHash:md5(foobar) = 3858f62230ac3c915f300c664312c63f”。
A hash is the result of a cryptographic function that takes an arbitrarily sized string of data, performs a mathematical encryption function on it, and returns a fixed-size string.
哈希是一种加密功能所获得的结果，这种加密需要获取任意大小的字符串数据，并用算法对其进行加密，然后返回一个固定大小的字符串。
In Listing 5 we build the array reference dynamically during the call, and then use the OID as the hash key when printing out the result.
在清单5中，我们在调用期间动态地构建了数组引用，然后在打印结果时使用OID作为散列键。
The first line of the result gives the hash of the key.
结果的第一行提供了密匙散列。
The result is the name of the key pair, followed by the hash.
结果是密匙对名称，后跟散列数据。
This is because any change to the document will result in a new hash of the document (which is what CouchDB USES to create the revision ID).
这是因为任何文档更改都会导致一个新的文档哈希表(这是CouchDB用于创建修订id的东西)。
The construction of a provable hash algorithm is developed based on the operations from various groups, also, a safety message authentication code is presented by the result.
本文利用来自不同群的运算，构造一种能证明其安全性的杂凑算法，并应用已证明的结果构造安全的消息认证码。
A good hash function gives a completely different result if the original file is changed even slightly.
即使源文件只是做了一点点微小的修改，一个好的散列函数仍然可以给出完全不同的结果。
Just select a file to generate a hash for, click on the button for the type of hash to generate and watch the result magically appear.
只要选择一个文件生成一个哈希，请在哈希表的类型，产生的结果看神奇地出现按钮。
Small changes to the data result in large unpredictable changes in the hash.
数据的少量更改会在哈希值中产生不可预知的大量更改。
When a hash collision occurs, the system won't store the new data because it sees that its hash number already exists in the index... This is called a false positive, and can result in data loss.
当哈希冲突发生时，系统不会储存新数据，因为它看到它的散列人数已经存在于索引…这就是所谓的假阳性，并可能造成数据丢失。
Any change to the data or the hash value will result in a mismatch, because knowledge of the secret key is required to change the message and reproduce the correct hash value.
对资料或杂凑值所做的任何变更都将导致结果不相符，因为必须具有秘密金钥的资讯，才能变更讯息并重新产生正确的杂凑值。
The experimental result shows that the method is implemented easily and fast. Therefore, the method has a good hash performance and satisfies security requirements.
实验表明：该方法简单，具有良好的单向散列性能，并能满足一定的安全性要求。
The experimental result shows that the method is implemented easily and fast. Therefore, the method has a good hash performance and satisfies security requirements.
实验表明：该方法简单，具有良好的单向散列性能，并能满足一定的安全性要求。
应用推荐