Введите слово или словосочетание на любом языке 👆
Язык:
Перевод и анализ слов искусственным интеллектом ChatGPT
На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:
- как употребляется слово
- частота употребления
- используется оно чаще в устной или письменной речи
- варианты перевода слова
- примеры употребления (несколько фраз с переводом)
- этимология
Что (кто) такое hash collisions - определение
COMPUTER SCIENCE SITUATION WHERE TWO DATA ELEMENTS SHARE A HASHTAG, CHECKSUM, FINGERPRINT, ETC.
Hash collisions; Hash collision (computer science); Cryptographic hash collision
Найдено результатов: 186
Hash collision
In computer science, a hash collision or clash is when two pieces of data in a hash table share the same hash value. The hash value in this case is derived from a hash function which takes a data input and returns a fixed length of bits.
hash collision
<programming> (Or "hash clash") When two different keys hash
to the same value, i.e. to the same location in a {hash
table}.
ESR once asked a friend what he expected Berkeley to be
like. The friend replied, "Well, I have this mental picture
of naked women throwing Molotov cocktails, but I think that's
just a collision in my hash tables."
[Jargon File ]
(1995-01-23)
hash table
![This graph compares the average number of CPU cache misses required to look up elements in large hash tables (far exceeding size of the cache) with chaining and linear probing. Linear probing performs better due to better [[locality of reference]], though as the table gets full, its performance degrades drastically.](https://commons.wikimedia.org/wiki/Special:FilePath/Hash table average insertion time.png?width=200 "This graph compares the average number of CPU cache misses required to look up elements in large hash tables (far exceeding size of the cache) with chaining and linear probing. Linear probing performs better due to better [[locality of reference]], though as the table gets full, its performance degrades drastically.")
ASSOCIATES DATA VALUES WITH KEY VALUES - A LOOKUP TABLE
Hashtable; Hash-table; Hash tables; Hash map; Rehash; Hashmap; Open hashing; Scatter storage; Address-calculation sort; Hash Table; Chaining hash table; Separate chaining; Direct chaining; Collision resolution scheme; External chaining; Load factor (computer science); Hash-Based Indexes; Hash table collisions; Hash table collision; Array hash table; Dynamic-sized hash table; Collision resolution in hash tables
one-way hash function
SPECIAL CLASS OF HASH FUNCTION THAT HAS CERTAIN PROPERTIES WHICH MAKE IT SUITABLE FOR USE IN CRYPTOGRAPHY
Message digest; Cryptographic hash; Cryptographic message digest; One-way hash; Modification Detection Code; Cryptographic hash functions; Hash function (cryptography); One-way hash function; CRHF; Secure hash function; One way encryption; Numerical hash; Cryptograhic hash; Cryptographic hash value; Cryptographic Hash Function; Cryptographic one-way hash function; Message-digest; Message-digest algorithm; Sphincter hash; Terahash; Cryptographic hashing; Wide pipe; Wide pipe hash; Wide pipe design; Wide pipe construction; Wide-pipe; Widepipe; Narrowpipe; Narrow-pipe; Narrow pipe; Applications of cryptographic hash functions; Cryptographic hashes; Hash (cryptography)
<algorithm> (Or "message digest function") A {one-way
function} which takes a variable-length message and produces a
fixed-length hash. Given the hash it is computationally
infeasible to find a message with that hash; in fact one can't
determine any usable information about a message with that
hash, not even a single bit. For some one-way hash functions
it's also computationally impossible to determine two messages
which produce the same hash.
A one-way hash function can be private or public, just like an
encryption function. MD5, SHA and Snefru are examples of
public one-way hash functions.
A public one-way hash function can be used to speed up a
public-key digital signature system. Rather than sign a
long message, which can take a long time, compute the one-way
hash of the message, and sign the hash.
{sci.crypt FAQ
(ftp://src.doc.ic.ac.uk/usenet/usenet-by-group/sci.crypt/) }.
(2001-05-10)
Merkle tree
TREE DATA STRUCTURE WHOSE NODES ARE RECURSIVELY CRYPTOGRAPHICALLY HASHED
Tiger-Tree Hash; Merkle Hash Tree; TigerTree Hash; Tigertree; Tiger-tree hash; Tiger tree hash; Merkle trees; Tiger tree; Tiger Tree; Merkle root; Merkle Tree; Merkel tree; Tthsum
In cryptography and computer science, a hash tree or Merkle tree is a tree in which every "leaf" (node) is labelled with the cryptographic hash of a data block, and every node that is not a leaf (called a branch, inner node, or inode) is labelled with the cryptographic hash of the labels of its child nodes. A hash tree allows efficient and secure verification of the contents of a large data structure.
Secure Hash Algorithm
FAMILY OF CRYPTOGRAPHIC HASH FUNCTIONS
Secure Hash Algorithm family; SHA family; Secure Hash Standard; SHA family hash functions; Secure hash algorithm; Secure hash functions; Secure hash algorithms; Sha hash; SHA hash functions; SHA hash; Secure Hash Algorithm (disambiguation); Secure Hash Algorithm (Police); Secure Hash Algorithm; Comparison of SHA functions
<algorithm, cryptography> (SHA) A one-way hash function
developped by NIST and defined in standard FIPS 180.
SHA-1 is a revision published in 1994; it is also described
in ANSI standard X9.30 (part 2).
(2003-04-12)
Secure Hash Algorithms
FAMILY OF CRYPTOGRAPHIC HASH FUNCTIONS
Secure Hash Algorithm family; SHA family; Secure Hash Standard; SHA family hash functions; Secure hash algorithm; Secure hash functions; Secure hash algorithms; Sha hash; SHA hash functions; SHA hash; Secure Hash Algorithm (disambiguation); Secure Hash Algorithm (Police); Secure Hash Algorithm; Comparison of SHA functions
The Secure Hash Algorithms are a family of cryptographic hash functions published by the National Institute of Standards and Technology (NIST) as a U.S.
Fast syndrome-based hash
FAMILY OF CRYPTOGRAPHIC HASH FUNCTIONS
User:Joost Lambregts/fsb; Fast Syndrome Based Hash
In cryptography, the fast syndrome-based hash functions (FSB) are a family of cryptographic hash functions introduced in 2003 by Daniel Augot, Matthieu Finiasz, and Nicolas Sendrier.
Maher-shalal-hash-baz
THE SECOND MENTIONED PROPHETIC-NAME CHILD IN ISAIAH CHAPTER 7–9
Mahershalalhashbaz; Maher-shalal-chash-baz; Maher shalal chash baz; Maher shalal hash baz; Mahershalalchashbaz; Maher Shalal Hash Baz; Mahershalalhashabaz; Maher-Shalal-Hash-Baz
"Maher-shalal-hash-baz" (;churchofjesuschrist.org: "Book of Mormon Pronunciation Guide" (retrieved 2012-02-25), IPA-ified from «mā´her—shăl-ăl—hăsh´bäz» , – "Hurry to the spoils!
Hash (food)
.jpg?width=200)
![Texas]] hash with [[cornbread]] and green beans](https://commons.wikimedia.org/wiki/Special:FilePath/Texas Hash.JPG?width=200 "Texas]] hash with [[cornbread]] and green beans")
FOOD
Corned beef hash; Corned-beef hash; Hashed beef; Corn beef hash; Hashed pole corn; Yukon hash
Hash is a culinary dish consisting of chopped meat, potatoes, and fried onions. The name is derived from , meaning "to chop".
Википедия
Hash collision
In computer science, a hash collision or hash clash is when two pieces of data in a hash table share the same hash value. The hash value in this case is derived from a hash function which takes a data input and returns a fixed length of bits.
Although hash algorithms have been created with the intent of being collision resistant, they can still sometimes map different data to the same hash (by virtue of the pigeonhole principle). Malicious users can take advantage of this to mimic, access, or alter data.
Due to the possible negative applications of hash collisions in data management and computer security (in particular, cryptographic hash functions), collision avoidance has become an important topic in computer security.
