AI & ChatGPT searches , social queriess for HASH KEY
Search references for HASH KEY. Phrases containing HASH KEY
See searches and references containing HASH KEY!
Search references for HASH KEY. Phrases containing HASH KEY
See searches and references containing HASH KEY!HASH KEY
Topics referred to by the same term
Hash key may refer to: Telephone keypad § Hash key, also known as the number, pound or hash key, a key on a telephone keypad For its use in data structure
Hash_key
Computer communications authentication algorithm
cryptography, an HMAC (sometimes expanded as either keyed-hash message authentication code or hash-based message authentication code) is a specific type
HMAC
Associative array for storing key–value pairs
abstract data type that maps keys to values. A hash table uses a hash function to compute an index, also called a hash code, into an array of buckets
Hash_table
Mapping arbitrary data to fixed-size values
output. The values returned by a hash function are called hash values, hash codes, (hash/message) digests, or simply hashes. The values are usually used to
Hash_function
Hash function that is suitable for use in cryptography
the hash output is then hashed with the next block, creating a new hash reflecting everything to that point; again and again until the final hash reflects
Cryptographic_hash_function
Function that derives secret keys from a secret value
typically uses a cryptographic hash function or block cipher). KDFs can be used to stretch keys into longer keys or to obtain keys of a required format, such
Key_derivation_function
Information used for message authentication and integrity checking
integrity code (MIC), and instead use checksum, error detection code, hash, keyed hash, message authentication code, or protected checksum. Informally, a
Message_authentication_code
Type of data structure
the above picture hash 0 is the result of hashing the concatenation of hash 0-0 and hash 0-1. That is, hash 0 = hash( hash 0-0 + hash 0-1 ) where "+" denotes
Merkle_tree
Hash functions
message authentication code (MAC). SipHash, however, is not a general purpose key-less hash function such as Secure Hash Algorithms (SHA) and therefore must
SipHash
Cryptographic hash function
BLAKE is a cryptographic hash function based on Daniel J. Bernstein's ChaCha stream cipher, but a permuted copy of the input block, XORed with round constants
BLAKE_(hash_function)
Collection of hash functions
{ hash += key[i++]; hash += hash << 10; hash ^= hash >> 6; } hash += hash << 3; hash ^= hash >> 11; hash += hash << 15; return hash; } Sample hash values
Jenkins_hash_function
Computer programming technique
resolve hash collisions, by using a secondary hash of the key as an offset when a collision occurs. Double hashing with open addressing is a classical data
Double_hashing
Typographic symbol (#)
The symbol # is known as the number sign, hash, and (in North America) the pound sign and has a variety of other names. The symbol has historically been
Number_sign
Message-digest hashing algorithm
is a widely used hash function producing a 128-bit hash value. MD5 was designed by Ronald Rivest in 1991 to replace an earlier hash function MD4, and
MD5
Techniques to protect against brute-force attack
key stretching. One way is to apply a cryptographic hash function or a block cipher repeatedly in a loop. For example, in applications where the key is
Key_stretching
a checksum. Hash function security summary Secure Hash Algorithms NIST hash function competition Key derivation functions (category) "Hash functions".
List_of_hash_functions
Non-cryptographic hash function
fnv-1 is hash := FNV_offset_basis for each byte_of_data to be hashed do hash := hash × FNV_prime hash := hash XOR byte_of_data return hash In the above
Fowler–Noll–Vo_hash_function
Random data used as an additional input to a hash function
password (or its version after key stretching) are concatenated and fed to a cryptographic hash function, and the output hash value is then stored with the
Salt_(cryptography)
Hash function phenomenon
computer science, a hash collision or hash clash is when two distinct pieces of data in a hash table share the same hash value. The hash value in this case
Hash_collision
Password cracking dataset
this attack is to compute the hashes using a key derivation function that adds a "salt" to each password before hashing it, with different passwords receiving
Rainbow_table
Decentralized distributed system with lookup service
A distributed hash table (DHT) is a distributed system that provides a lookup service similar to a hash table. Key–value pairs are stored in a DHT, and
Distributed_hash_table
Hashing technique
science, consistent hashing is a special kind of hashing technique such that when a hash table is resized, only n / m {\displaystyle n/m} keys need to be remapped
Consistent_hashing
Method of producing many one-time keys from a single key
is a method used to produce many one-time keys from a single key or password. For non-repudiation, a hash function can be applied successively to additional
Hash_chain
Hash collision resolution technique
Hopscotch hashing, Robin Hood hashing, last-come-first-served hashing and cuckoo hashing move existing keys around in the array to make room for the new key. This
Open_addressing
Attack against cryptographical hash functions
is a type of attack where an attacker can use Hash(message1) and the length of message1 to calculate Hash(message1 ‖ message2) for an attacker-controlled
Length_extension_attack
Key derivation function
only produce derived keys up to 160 bits long. RFC 8018 (PKCS #5 v2.1), published in 2017, recommends PBKDF2 for password hashing. PBKDF2 applies a pseudorandom
PBKDF2
Computer function
c2 hash ← hash XOR remainingBytes hash ← hash XOR len hash ← hash XOR (hash >> 16) hash ← hash × 0x85ebca6b hash ← hash XOR (hash >> 13) hash ← hash ×
MurmurHash
Set of cryptographic hash functions
SHA-2 (Secure Hash Algorithm 2) is a set of cryptographic hash functions designed by the United States National Security Agency (NSA) and first published
SHA-2
Cryptographic hash function
cryptography, SHA-1 (Secure Hash Algorithm 1) is a hash function which takes an input and produces a 160-bit (20-byte) hash value known as a message digest
SHA-1
Cryptographic secret, not public in contrast to salt
password hash, and it is similar to an encryption key in that it should be kept secret. A pepper performs a comparable role to a salt or an encryption key, but
Pepper_(cryptography)
Hash function without any collisions
the perfect hash function is in O(n) where n is the number of keys in the structure. The important performance parameters for perfect hash functions are
Perfect_hash_function
Concept in cryptography
Hash-based cryptography is the generic term for constructions of cryptographic primitives based on the security of hash functions. It is of interest as
Hash-based_cryptography
Practice and study of secure communication techniques
(MACs) are much like cryptographic hash functions, except that a secret key can be used to authenticate the hash value upon receipt; this additional
Cryptography
Cryptographic attack
a collision attack on a cryptographic hash tries to find two inputs producing the same hash value, i.e. a hash collision. This is in contrast to a preimage
Collision_attack
Data structure hashing scheme
2020. Cuckoo hashing is a form of open addressing in which each non-empty cell of a hash table contains a key or key–value pair. A hash function is used
Cuckoo_hashing
Cryptographic hash function
Skein is a cryptographic hash function and one of five finalists in the NIST hash function competition. Entered as a candidate to become the SHA-3 standard
Skein_(hash_function)
Family of cryptographic hash 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
Secure_Hash_Algorithms
Data structure holding key/value pairs
operation for a hash table is only the computation of the key's hash, combined with accessing the corresponding bucket within the array. As such, hash tables usually
Associative_array
Computer programming method for hashing
collisions in hash tables, data structures for maintaining a collection of key–value pairs and looking up the value associated with a given key. It was invented
Linear_probing
Key derivation function based on an HMAC
as the key (all zeros up to length of the underlying extractor hash function, if not provided) and the IKM as the message. The underlying hash function
HKDF
Concept in relational database design
In relational database management systems, a unique key is a candidate key. All the candidate keys of a relation can uniquely identify the records of the
Unique_key
Password-based key derivation function
is more accurate at hashing) to replace some of the subkeys. Then it uses this modified state to encrypt another part of the key, and uses the result
Bcrypt
Topics referred to by the same term
Look up hash in Wiktionary, the free dictionary. Hash, hashes, hash mark, or hashing may refer to: Hash (food), a coarse mixture of ingredients, often
Hash
2015 password-based key derivation function
Argon2 is a key derivation function that was selected as the winner of the 2015 Password Hashing Competition. It was designed by Alex Biryukov, Daniel
Argon2
Hash functions computed by exclusive or
the form of Zobrist hashing for computer games; later work by Carter and Wegman extended this method to arbitrary fixed-length keys. Generalizations of
Tabulation_hashing
Obsolete cryptographic hash function
favor of SHA-256 and other strong hashing algorithms. Nevertheless, as of 2014[update], it remained in use in public key infrastructures as part of certificates
MD2_(hash_function)
Keypad that appears on some telephones
two additional keys: the "star key", labeled ⚹, and the "square key", labeled ⌗. The square key is often known as the pound key, hash key or octothorp.
Telephone_keypad
Open competition to select password hash functions
The Password Hashing Competition was an open competition announced in 2013 to select one or more password hash functions that can be recognized as a recommended
Password_Hashing_Competition
Authenticated encryption mode
C)=X_{m+n+1}} , where H = E k ( 0 128 ) {\displaystyle H=E_{k}(0^{128})} is the hash key, a string of 128 zero bits encrypted using the block cipher; A {\displaystyle
Galois/Counter_Mode
BitTorrent-related file format
pieces key in the info list. Instead, such a torrent file has a root_hash key in the info list. This key's value is the root hash of the Merkle hash: { #
Torrent_file
Cryptanalytic method for unauthorized users to access data
attacks. A special form of credential recycling is pass the hash, where unsalted hashed credentials are stolen and re-used without first being brute-forced
Brute-force_attack
Data structure for approximate set membership
to a hash function that takes an initial value; or add (or append) these values to the key. For larger m and/or k, independence among the hash functions
Bloom_filter
Dynamic data structure
Linear hashing (LH) is a dynamic data structure which implements a hash table and grows or shrinks one bucket at a time. It was invented by Witold Litwin
Linear_hashing
Attack model against cryptographic hash functions
preimage attack on cryptographic hash functions tries to find a message that has a specific hash value. A cryptographic hash function should resist attacks
Preimage_attack
Tables comparing general and technical information for common hashes
overview of hash function security/cryptanalysis can be found at hash function security summary. Basic general information about the cryptographic hash functions:
Comparison of cryptographic hash functions
Comparison_of_cryptographic_hash_functions
Short sequence of bytes used to authenticate or look up a longer public key
cryptographic hash function to a public key. Since fingerprints are shorter than the keys they refer to, they can be used to simplify certain key management
Public_key_fingerprint
Cryptographic hash function
cryptographic hash function designed by Ross Anderson and Eli Biham in 1995 for efficiency on 64-bit platforms. The size of a Tiger hash value is 192 bits
Tiger_(hash_function)
Message authentication code algorithm
15 December 2018 – via GitHub. "Ruby C extension for the AES-CMAC keyed hash function (RFC 4493): louismullie/cmac-rb". 4 May 2016 – via GitHub. RFC 4493
One-key_MAC
Cryptographic hash function
The MD4 Message-Digest Algorithm is a cryptographic hash function developed by Ronald Rivest in 1990. The digest length is 128 bits. The algorithm has
MD4
Cryptographic hash function
JH is a cryptographic hash function submitted to the NIST hash function competition by Hongjun Wu. Though chosen as one of the five finalists of the competition
JH_(hash_function)
Cryptographic primitive
the name of a hash function patented by IBM.) Another method is 2BOW (or NBOW in general), which is a "high-rate multi-block-length hash function based
One-way_compression_function
Set of cryptographic hash functions
SHA-3 (Secure Hash Algorithm 3) is the latest member of the Secure Hash Algorithm family of standards, released by NIST on August 5, 2015. Although part
SHA-3
Publicly known attacks against cryptographic hash functions
cryptographic hash functions. Note that not all entries may be up to date. For a summary of other hash function parameters, see comparison of cryptographic hash functions
Hash function security summary
Hash_function_security_summary
Algorithm
design, secure key establishment, and sharding and distributed databases. Other examples of real-world systems that use Rendezvous Hashing include the GitHub
Rendezvous_hashing
2009 password-based key derivation function
Passphrase: Bytes string of characters to be hashed Salt: Bytes string of random characters that modifies the hash to protect against Rainbow table attacks
Scrypt
Cryptography algorithm
with HMAC, CMAC, and GMAC. HMAC was approved in 2002 as FIPS 198, The Keyed-Hash Message Authentication Code (HMAC), CMAC was released in 2005 under SP800-38B
Block cipher mode of operation
Block_cipher_mode_of_operation
Type of cryptographic attack
possible values of a hash function, with H = 2 l {\textstyle H=2^{l}} . With a birthday attack, it is possible to find a collision of a hash function with 50
Birthday_attack
Key derivation function of password hash
crypt is a POSIX C library function. It is typically used to compute the hash of user account passwords. The function outputs a text string which also
Crypt_(C)
Authenticated encryption with associated data algorithm
suggestions, including using Chacha20 instead of Salsa20 and using a universal hashing based MAC for performance. The outcome of this process was the adoption
ChaCha20-Poly1305
Hash function construction used in computer programs that play abstract board games
Zobrist hashing (also referred to as Zobrist keys or Zobrist signatures ) is a hash function construction used in computer programs that play abstract
Zobrist_hashing
Compressed form of cannabis resin
In the United States, dried flowers or concentrates are more popular, and hash has seen a relative decrease in popularity following changes in laws that
Hashish
Cryptographic hash function
Algorithm is a cryptographic hash function. It uses a Merkle tree-like structure to allow for immense parallel computation of hashes for very long inputs. Authors
MD6
Memory-hard key derivation function
Balloon hashing is a key derivation function presenting proven memory-hard password-hashing and modern design. It was created by Dan Boneh, Henry Corrigan-Gibbs
Balloon_hashing
Algorithm for public-key cryptography
message m and signature s, he uses the same hash algorithm in conjunction with Alice's public key to compute h = hash(m). He raises the signature s to the power
RSA_cryptosystem
Cryptographic hash function
ShangMi 3 (SM3) is a cryptographic hash function, standardised for use in commercial cryptography in China. It was published by the State Cryptography
SM3_(hash_function)
Microsoft network operating system
effectively reduces the LM hash key space to 69 characters. A 14-character password is broken into 7+7 characters and the hash is calculated for each half
LAN_Manager
System for dealing with email spam
number with a string several times and hash this new string. It then has to do so over and over until a hash beginning with a certain number of zeros
Hashcash
Concept in cryptography
property of cryptographic algorithms, typically block ciphers and cryptographic hash functions, wherein if an input is changed slightly (for example, flipping
Avalanche_effect
Digital signature scheme
In hash-based cryptography, the Merkle signature scheme is a digital signature scheme based on Merkle trees (also called hash trees) and one-time signatures
Merkle_signature_scheme
Technique in functional programming
;; weak hashes ;; (require 'hash-table) (define (make-weak-table . args) (apply make-hash-table args)) (define (weak-table-set! table key data) (let
Hash_consing
Cryptographic hash function
cryptography, Whirlpool (sometimes styled WHIRLPOOL) is a cryptographic hash function. It was designed by Vincent Rijmen (co-creator of the Advanced Encryption
Whirlpool_(hash_function)
System that regulates the formation of blocks on a blockchain
2004 through the idea of "reusable proof of work" using the 160-bit secure hash algorithm 1 (SHA-1). Proof of work was later popularized by Bitcoin as a
Proof_of_work
Password-based key derivation function
yescrypt is a cryptographic key derivation function used for password hashing on Fedora Linux, Debian, Ubuntu, and Arch Linux. The function is more resistant
Yescrypt
Cryptographic algorithm for digital signatures
value results in a distinct recovered key. Calculate e = HASH ( m ) {\displaystyle e={\textrm {HASH}}(m)} , where HASH is the same function used in the signature
Elliptic Curve Digital Signature Algorithm
Elliptic_Curve_Digital_Signature_Algorithm
Cryptographic hash function
is a cryptographic hash function submitted by the France-funded research project Saphir to NIST's international competition on hash functions. The research
Shabal
Technique for selecting hash functions
computing, universal hashing (in a randomized algorithm or data structure) refers to selecting a hash function at random from a family of hash functions with
Universal_hashing
Algorithm used in relational databases
The hash join is an example of a join algorithm and is used in the implementation of a relational database management system. All variants of hash join
Hash_join
Search tree data structure
the entire key. Tries are particularly effective for tasks such as autocomplete, spell checking, and IP routing, offering advantages over hash tables due
Trie
Cryptographic hash function
In cryptography, N-hash is a cryptographic hash function based on the FEAL round function, and is now considered insecure. It was proposed in 1990 in an
N-hash
Method of negotiating credentials between web server and browser
development of keyed-hash message authentication code (HMAC). Although the cryptographic construction that is used is based on the MD5 hash function, collision
Digest_access_authentication
Post-quantum digital signature scheme
is a post quantum digital signature scheme that is based on cryptographic hash functions. As a part of the NIST Post-Quantum Cryptography Standardization
SPHINCS+
Cryptographic signature scheme
However, many Lamport signatures can be handled by one Merkle hash tree, thus a single hash tree key can be used for many messages, making this a fairly efficient
Lamport_signature
Method of building collision-resistant cryptographic hash functions
Merkle–Damgård construction or Merkle–Damgård hash function is a method of building collision-resistant cryptographic hash functions from collision-resistant one-way
Merkle–Damgård_construction
Russian cryptographic hash function
cryptographic hash function defined in the Russian national standard GOST R 34.11-2012 Information Technology – Cryptographic Information Security – Hash Function
Streebog
Universal hash family used for message authentication in cryptography
authenticator that combines the Poly1305 hash with AES-128 to authenticate many messages using a single short key and distinct message numbers. Poly1305
Poly1305
Competition to develop SHA-3
NIST hash function competition was an open competition held by the US National Institute of Standards and Technology (NIST) to develop a new hash function
NIST hash function competition
NIST_hash_function_competition
Type of standardized secure cryptoprocessors
secure generation of cryptographic keys for limited uses. Remote attestation: Creates a nearly unforgeable hash key summary of the hardware and software
Trusted_Platform_Module
Type of hash system
Extendible hashing is a type of hash system which treats a hash as a bit string and uses a trie for bucket lookup. Because of the hierarchical nature of
Extendible_hashing
Formatted data in computer science
programming. In its basic form, a hash tree stores the hashes of its keys, regarded as strings of bits, in a trie, with the actual keys and (optional) values stored
Hash tree (persistent data structure)
Hash_tree_(persistent_data_structure)
Hash functions intended for applications that do not need rigorous security
non-cryptographic hash functions (NCHFs) are hash functions intended for applications that do not need the rigorous security requirements of the cryptographic hash functions
Non-cryptographic hash function
Non-cryptographic_hash_function
HASH KEY
HASH KEY
Girl/Female
Australian, British, Chinese, English, Gujarati, Indian
Form of Ashley; Ash Tree Meadow
Surname or Lastname
English
English : variant of Pask, from the byform pasche, Latin pascha.Americanized spelling of German Pasch.
Surname or Lastname
English and Scottish
English and Scottish : unexplained.
Boy/Male
Hindu
Happiness
Boy/Male
American, Australian, British, English, Hebrew, Hindu, Indian
From the Ash Tree Farm; Ash Trees Meadow; Felicitous
Boy/Male
Hindu
Eye
Surname or Lastname
German
German : probably a habitational name from Haste near Wunstorf or Osnabrück.Dutch : nickname from Middle Dutch haest ‘hasty’.Swedish : soldier’s name, from hast ‘haste’, ‘hurry’.English (Lancashire and Yorkshire) : reduced form of Hayhurst.
Surname or Lastname
English
English : topographic name for someone who lived near an ash tree, or a habitational name from a place named with the Old English word æsc (see Ash). The Anglo-Norman French preposition de ‘of’, ‘from’ has become fused to the name.Americanized spelling of German Dasch.Indian : variant of Das.
Surname or Lastname
English
English : variant of Marsh.Americanized spelling of German Masch.Jewish (Ashkenazic) : unexplained; possibly an acronymic name.
Surname or Lastname
English
English : variant of Ash; the name arose as the result of misdivision of Middle English atter ashe ‘at the ash tree’ (Old English æt þǣre æsce).Jewish : of uncertain origin; the Guggenheimers consider it to be a variant of Rasch 1.Americanized spelling of German and Jewish Rasch.
Male
Hindi/Indian
(यश) Hindi name YASH means "glory."
Boy/Male
Muslim
Acme of mountain
Boy/Male
Hindu
God is gracious, Kirti, Good wishes
Surname or Lastname
German
German : nickname for a swift runner or a timorous person, from Middle High German, Middle Low German hase ‘hare’.Jewish (Ashkenazic) : ornamental name from German Hase ‘hare’.English : from a Middle English nickname, Hase, from Old English hÄs ‘harsh, raucous, or hoarse voice’.Japanese : usually written with characters meaning ‘long valley’; habitational name from a place in Yamato (now Nara prefecture). Listed in the Shinsen shÅjiroku. Some bearers are descended from the Taira clan; they are found mainly in eastern Japan. Also pronounced Nagaya and Nagatani; the original pronunciation was Hatsuse, meaning ‘beginning of the strait’.
Boy/Male
American, Australian, British, Chinese, Christian, English
Dweller by the Ash Tree; Adventurer; Cliff
Surname or Lastname
English
English : topographic name for someone who lived by an ash tree, a variant of Ash by misdivision of Middle English atten ash ‘at the ash’, or a habitational name from any of the many places in England and Wales named Nash, from this phrase, as for example Nash in Buckinghamshire, Herefordshire, or Shropshire. The name was established from an early date in Wales and Ireland.Jewish : of unknown origin, possibly an Americanized form of one or more like-sounding Jewish surnames.The surname Nash was taken to Ireland from England or Wales by a family who established themselves in Co. Kerry in the 13th century, during the second wave of Anglo-Norman settlement.
Female
Vietnamese
Vietnamese name HANH means "has good conduct."
Male
English
 Short form of English unisex Ashley, ASH means "ash-tree grove."Â
Surname or Lastname
English
English : from Middle English asche ‘ash tree’ (Old English æsc), hence a topographic name for someone living by an ash tree or a habitational name from any of the many places in southern and central England named with this word (Derbyshire, Dorset, Hampshire, Herefordshire, Kent, Surrey, Shropshire, Somerset, and elsewhere).In New England, Ash is commonly found for French Dufresne, with the same meaning.Jewish (Ashkenazic) : from an acronym for Yiddish AltSHul (see Altschul) or AyznSHtot (see Eisenstadt).
Surname or Lastname
English
English : topographic name for someone who lived by an ash tree, from the Middle English phrase at(te) asche ‘at (the) ash’.Jewish (Ashkenazic) : metonymic occupational name for a maker or seller of bags and purses, from German Tasche ‘bag’, ‘purse’. Compare Taschner.
HASH KEY
HASH KEY
Boy/Male
American, Australian, British, Chinese, Christian, English, German, Latin
Lord; Child Born on Sunday; Belongs to the Lord
Boy/Male
Hindu, Indian, Marathi
Immortal
Surname or Lastname
English and Irish
English and Irish : habitational name from places in Cheshire and Lancashire called Hollingworth, from Old English hole(g)n ‘holly’ + worð ‘enclosure’. The surname was taken to Ireland in the 17th century.Jewish (American) : presumably an Americanized form of some like-sounding Jewish name.
Boy/Male
Welsh
Prince.
Boy/Male
Indian, Punjabi, Sikh
Lord Krishna's Love or the Love for Lord Krishna
Boy/Male
Tamil
Manwendra | மாநவேநà¯à®¤à¯à®°Â Â
King among men
Boy/Male
Christian & English(British/American/Australian)
Dark Skin
Surname or Lastname
English
English : habitational name, perhaps from Wanstead in Greater London (formerly Esses), recorded in Domesday Book as Wenesteda ‘site (Old English stede) by a mound (Old English wænn) or where wagons (Old English wǣn) are kept’, but more likely from Winestead in East Yorkshire, named from Old English wīf ‘wife’ or a female personal name Wīfa + stede ‘homestead’.
Boy/Male
English
From the marsh valley.
Boy/Male
Egyptian
Creek.
HASH KEY
HASH KEY
HASH KEY
HASH KEY
HASH KEY
n.
A sash.
n.
A rapid movement, esp. one of short duration; a quick stroke or blow; a sudden onset or rush; as, a bold dash at the enemy; a dash of rain.
v. t.
To cover with water or any liquid; to wet; to fall on and moisten; hence, to overflow or dash against; as, waves wash the shore.
n.
A slight admixture, infusion, or adulteration; a partial overspreading; as, wine with a dash of water; red with a dash of purple.
n.
To bind with a rope, cord, thong, or chain, so as to fasten; as, to lash something to a spar; to lash a pack on a horse's back.
n.
A sudden check; abashment; frustration; ruin; as, his hopes received a dash.
v. t.
To strike; to crush; to smash; to dash in pieces.
v. t.
To furnish with a sash or sashes; as, to sash a door or a window.
n.
A liquid preparation for the hair; as, a hair wash.
v. t.
To cleanse by ablution, or dipping or rubbing in water; to apply water or other liquid to for the purpose of cleansing; to scrub with water, etc., or as with water; as, to wash the hands or body; to wash garments; to wash sheep or wool; to wash the pavement or floor; to wash the bark of trees.
n.
Immediate or prompt payment in current funds; as, to sell goods for cash; to make a reduction in price for cash.
3d pers. sing. pres.
Has.
v. t.
To convert into a mash; to reduce to a soft pulpy state by beating or pressure; to bruise; to crush; as, to mash apples in a mill, or potatoes with a pestle. Specifically (Brewing), to convert, as malt, or malt and meal, into the mash which makes wort.
n.
To /hop into small pieces; to mince and mix; as, to hash meat.
superl.
Uttered or undertaken with too much haste or too little reflection; as, rash words; rash measures.
v. t.
To pay, or to receive, cash for; to exchange for money; as, cash a note or an order.
v. t.
To shut or fasten with a hasp.
v. t.
To adorn with a sash or scarf.
a.
Capable of being washed without injury; washable; as, wash goods.
v. t.
To strike with a lash ; to whip or scourge with a lash, or with something like one.