Examples of using
散列
in Chinese and their translations into English
{-}
Political
Ecclesiastic
Programming
然后,那些散列会被放在一个公有或私有链上。
Those hashes are then placed on a public or private chain.
在Layman的术语中,没有称为去散列的过程。
In Layman's term, there is no process called de-hashing.
然后,那些散列会被放在一个公有或私有链上。
These hashes are, in turn, added to a public or private chain.
重新计算所有这些散列将需要巨大且不可能的计算能力。
Recalculating all those hashes would take an enormous and improbable amount of computing power.
这里,为了简单起见,我们将跳过散列步骤并仅对原始数据z进行签名。
Here, for the sake of simplicity, we will skip the hashing step and just sign the raw data z.
这是因为这些散列实际上是一种叫做多散列的东西。
This is because those hashes are actually something called a multihash.
交易费用授予那些成功散列包含相关交易的块的矿工。
The transaction fee is awarded to the miner that successfully hashes the block containing the relevant transaction.
我们发现这些散列需要许多支持文件才能成功执行。
We found these hashes need many support files for successful execution.
简单地说,散列意味着获取任何长度的输入字符串并给出一个固定长度的输出。
In simple terms, hashing means taking an input string of any length and giving out an output of a fixed length.
目前,脸谱和YouTube已开始采用散列技术,来自动移除极端主义内容。
YouTube and Facebook have begun to use hashes to automatically remove extremist content.
Hash是一个小型GUI工具,用于在许多文件上执行MD5,SHA1和CRC32散列函数。
Hash is a small GUI tool designed to perform MD5, SHA1, and CRC32 hashing functions on a number of files.
目前,脸谱和YouTube已开始采用散列技术,来自动移除极端主义内容。
YouTube and Facebook have started using hashes to automatically remove extremist content.
比特币系统使用双重散列SHA256,一种2000年代减缓哈希破解的常见手段。
The Bitcoin system uses double hashed SHA256 that was a common way to slow down hashing searches in the 2000's.
以LinkedIn为例,黑客贴出640万散列密码,让其它人协助破解。
In this case,hackers posted a list of 6.4 million hashed passwords online and asked others to help crack them.
然而,如果散列算法有一定的缺陷,如SHA-1,一个资金雄厚的攻击者就可以制造出碰撞。
However, if the hashing algorithm has some flaws, such as SHA-1, a well-equipped attacker can create a collision.
此外,如果数据被篡改,散列标签就会改变,从而引起对破坏的注意。
Additionally, if the data is tampered with, the hash tag will change, thus drawing attention to the breach.
散列函数通常用于证明某些事物与其他事物相同,而不事先揭示信息。
Hash functions are often used for proving that something is the same as something else, without revealing the information beforehand.
此外,如果数据被篡改,散列标签将发生变化,从而引起人们对违规的注意。
Additionally, if the data is tampered with, the hash tag will change, thus drawing attention to the breach.
散列函数和公钥加密是数字签名系统的核心,现已在各种案例中使用。
Hash functions and public-key cryptography are at the core of digital signature systems, which are now applied to a wide range of use cases.
例如,数字“指纹”常常被散列到区块链中,而信息的主体可以离线存储。
For instance, digital“fingerprints” are often hashed into the chain, and the main body of information is stored offline.
可以使用散列和/或数字签名来确保数据完整性,并对该卡及其包含的凭据进行身份验证。
Hashes and/or digital signatures can be used to ensure data integrity and to authenticate the card and the credentials it contains.
所有这些元数据,包括nonce随后被散列化,因此结果的哈希值看起来有点像上面的随机数之一。
All this metadata, including the nonce, is then hashed, so the resulting hash looks a bit like one of the random numbers above.
挖掘地图显示,散列设施和池操作符分布在全球,美国和加拿大有所增加。
The mining map exhibits that hashing facilities and pool operators are distributed globally, with growing operations in the USA and Canada.
散列函数用于检查消息的完整性,以确保消息不会被病毒更改,泄露或影响。
Hash functions are used to check the integrity of the message to ensure that the message has not be altered, compromised or affected by virus.
KDF恰巧具有密码散列函数所需的特性,即使它们最初并非为此目的而设计。
KDFs happen to have the characteristics desired for a"password hash function", even though they were not originally designed for this purpose.
此外,目录索引也优化为类似于散列B树结构,因此尽管限制更多,但ext4查找更快。
Directory indexing was also optimized to a hashed B-tree-like structure, so although the limits are much greater, ext4 supports very fast lookup times.
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.
此外,目录索引也优化为类似于散列B树结构,因此尽管限制更加多,但ext4支持更快的查找。
Directory indexing was also optimized to a hashed B-tree-like structure, so although the limits are much greater, ext4 supports very fast lookup times.
Chapter 5 has been extensively revised and enlarged and now contains material on two newer algorithms: cuckoo hashing and hopscotch hashing.
如我们在4.1节中所述,加密散列,共识机制和去中心化相结合可以保证区块链的不变性。
As we described in section 4.1, cryptographic hashing, a consensus mechanism, and decentralization in combination guarantee the immutability of a blockchain.
中文
Bahasa indonesia
日本語
عربى
Български
বাংলা
Český
Dansk
Deutsch
Ελληνικά
Español
Suomi
Français
עִברִית
हिंदी
Hrvatski
Magyar
Italiano
Қазақ
한국어
മലയാളം
मराठी
Bahasa malay
Nederlands
Norsk
Polski
Português
Română
Русский
Slovenský
Slovenski
Српски
Svenska
தமிழ்
తెలుగు
ไทย
Tagalog
Turkce
Українська
اردو
Tiếng việt