英語 での The same hash の使用例とその 日本語 への翻訳
{-}
-
Colloquial
-
Ecclesiastic
-
Computer
-
Programming
Have the same hash value.
Two completely different messages could have the same hash.
When checking membership, we calculate the same hash functions and check if all the bits are equal to 1.
Hashable objects which compare equal must have the same hash value.
Hashable objects which compare equality must have the same hash value.
Hashable objects which compare equal must have the same hash value.
Finding a pair of messages M1 and M2 that have the same hash value takes 2^(L/2) attempts.
It is very easy to compute the hash from a file but very difficult to craft asimilar file which will produce exactly the same hash.
Without a salt, this password would be stored as the same hash string in the password file.
Subsequently, if someone tries to upload an image that has the same hash value, it won't be visible to anyone.
No method isknown to exist which finds two files having the same hash value, nor to find a file with a specific hash value.
(treat two the same table andthe same record ID object as the same Hash key.).
When you get a value, the client determines the same hash value from the key and chooses the same server to get the information.
This is required in order to ensure all of the Rediskeys for a given queue are placed into the same hash slot:.
A given set of data will always yield the same hash, but if even one letter of the original data is changed,the hash will come out completely different.
Inadvertent or deliberate replays for requests incorporating the same hash algorithm and value may happen.
Messages that have other messages with the same hash must be created by the same person, and do not happen by accident under any known probable circumstances.
A collision occurswhen there are two different files that produce the same hash when run through the SHA-256 algorithm.
O A"second-preimage attack" allows an attacker who has a desired messageM1 to find another message M2 that has the same hash value in fewer than 2^L attempts.
Attacks against the"collision-free" property: o A"collision attack" allows an attacker to find two messages M1 andM2 that have the same hash value in fewer than 2^(L/2) attempts.
A"collision attack" allows an attacker to find two messages M1 andM2 that have the same hash value in fewer than 2^(L/2) attempts.
Derived classes that override GetHashCode must also override Equals toguarantee that two objects considered equal have the same hash code; otherwise,the Hashtable type might not work correctly.
Derived classes that override GetHashCode() must also override Equals(Object)to guarantee that two objects considered equal have the same hash code; otherwise,the Hashtable type might not work correctly.