Übersetzung für 'hash' von Englisch nach Deutsch

to hash

hackengastr.

zerkleinern

zusammenmischen

zerhacken

Werbung

to hash [meat]

haschierengastr.

to hash [fig.] [coll.]

verpfuschen [ugs.]

verpatzen [ugs.]

to hash sth. [transform according to a hash function]

den Hashwert von etw.^Dat. berechnencomp.

---

hash

Hackfleisch {n}gastr.

Haschee {n}gastr.

Faschiertes {n} [österr.]gastr.

hash <#> [esp. Br.]

Raute {f} <#>

Rautezeichen {n} <#>printtelecom.

hash <#>

Rautenzeichen {n} <#>printtelecom.

Lattenzaun {m} <#> [ugs.] [Rautenzeichen]printtelecom.

Doppelkreuz-Zeichen {n} <#>printtelecom.

hash [sl.] [hashish]

Hasch {n} [ugs.] [Haschisch]drugs

Haschisch {n} {m}drugs

hash [Am.]

Grieß {m} [Bildrauschen]electr.RadioTV

hash [coll.] [hashish]

Shit {m} {n} [ugs.] [Haschisch]drugs

hash [dish with minced or cubed meat]

Haché {n} [fachspr.] [Haschee]gastr.

---

to hash sth. out

etw. genau besprechenidiom

to hash sth. over [Am.] [coll.]

etw. breittreten [ugs.]

---

hash algorithm

Hash-Algorithmus {m}comp.

hash browns

Kartoffelpuffer {m}gastr.

Rösti {pl} [schweiz. {sg.}]gastr.

hash code

Hash-Code {m}comp.

hash cookie

Haschkeks {m}drugsgastr.

hash function

Hash-Funktion {f}comp.

hash key [esp. Br.]

Rautetaste {f} [z. B. Telefon]

hash map <HM>

Hashtabelle {f} <HT>comp.

hash mark

Rautensymbol {n}

hash mark [coll.] [U.S. military service stripe]

Dienstzeitstreifen {m} [auch: Dienstzeit-Streifen]mil.

hash mark [the symbol #] [coll.]

Nummernraute {f} [#-Zeichen]print

hash oil

Haschöl {n}

hash search

Hash-Suche {f}comp.

hash smoker [coll.]

Hascher {m} [ugs.] [veraltend] [Haschischraucher]drugs

hash sum

Hash-Summe {f} [Prüfsumme]comp.

hash table <HT>

Hashtabelle {f} <HT>comp.

Streuwerttabelle {f}comp.

hash tag <#>

Hashtag {n} {m} <#>Internet

hash total

Prüfsumme {f}

hash value [cryptography]

Hashwert {m} [Kryptographie]comp.

---

to hash and rehash sth. [coll.]

etw.^Akk. x-mal durchkauen [ugs.]

---

distributed hash table <DHT>

verteilte Streuwerttabelle {f}comp.

verteilte Hashtabelle {f} <VHT>comp.

hash browned potatoes {pl}

Rösti {f}gastr.

Swiss hash browns

Rösti {pl} [ugs. im Sinne von Röstitaler, Röstiecken]gastr.

Swiss hash browns {pl}

Rösti {f} [ugs. {n}]gastr.

---

to make a hash of sth. [coll.] [idiom]

etw.^Akk. verpatzen [ugs.]

etw.^Akk. vermasseln [ugs.]

etw.^Akk. verpfuschen [ugs.]

---

to smoke weed / pot / grass / hash [sl.]

kiffen [ugs.]drugs

---

hash-based message authentication code <HMAC>

Hash-Nachrichtenauthentifizierungs­code {m}comp.

• HAS-V is a cryptographic hash function with a variable output length. HAS-V is a hash function based on a block cipher. The hash function can produce hash values with lengths from 16 to 40 bytes.
• Binary hash chains are commonly used in association with a hash tree.
• A desired characteristic of a cryptographic hash algorithm is that (for all practical purposes) the hash result (referred to as a hash digest or a hash) of any two modules will produce the same hash value only if the modules are identical.
• The risk of accidental hash collision in a 160-bit hash is very small, even for exabytes of data.
• An application of fusion trees to hash tables was given by Willard, who describes a data structure for hashing in which an outer-level hash table with hash chaining is combined with a fusion tree representing each hash chain.

  ---

• In cryptography, a collision attack on a cryptographic hash tries to find two inputs producing the same hash value, i.e.
• A concurrent hash table (concurrent hash map) is an implementation of hash tables allowing "concurrent access" by "multiple" threads using a hash function.
• A hash table may use linked lists to store the chains of items that hash to the same position in the hash table.
• Most modern cryptographic hash functions process messages in fixed-length blocks; all but the earliest hash functions include some sort of padding scheme.
• A retrieval data structure can be used to construct a perfect hash function: First insert the keys into a cuckoo hash table with [...] hash functions [...] and buckets of size 1.

  ---