AI & ChatGPT searches , social queries for HASH COLLISION
Search references for HASH COLLISION. Phrases containing HASH COLLISION
See searches and references containing HASH COLLISION!
Search references for HASH COLLISION. Phrases containing HASH COLLISION
See searches and references containing HASH COLLISION!HASH COLLISION
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
Associative array for storing key–value pairs
hash map. Most hash table designs employ an imperfect hash function. Hash collisions, where the hash function generates the same index for more than one
Hash_table
Hash function that is suitable for use in cryptography
called a cryptographic hash collision. This property is sometimes referred to as strong collision resistance. It requires a hash value at least twice as
Cryptographic_hash_function
Cryptographic attack
cryptography, 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
Collision_attack
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
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
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 of
HMAC
Attack model against cryptographic hash functions
be compared with a collision resistance, in which it is computationally infeasible to find any two distinct inputs x, x′ that hash to the same output;
Preimage_attack
Property of cryptographic hash functions
In cryptography, collision resistance is a property of cryptographic hash functions: a hash function H is collision-resistant if it is hard to find two
Collision_resistance
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
Information used for message authentication and integrity checking
MAC key, stronger guarantees are needed, akin to collision resistance or preimage security in hash functions. For MACs, these concepts are known as commitment
Message_authentication_code
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
Obsolete cryptographic hash function
vulnerable to a collision attack with time complexity of 263.3 compression function evaluations and memory requirements of 252 hash values. This is slightly
MD2_(hash_function)
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
Method of building collision-resistant cryptographic hash functions
construction or Merkle–Damgård hash function is a method of building collision-resistant cryptographic hash functions from collision-resistant one-way compression
Merkle–Damgård_construction
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
Attack against cryptographical hash functions
calculated as Hash(message ‖ secret), isn't vulnerable to a length extension attack, but is vulnerable to another attack based on a hash collision. The vulnerable
Length_extension_attack
Password cracking dataset
cryptographic hash function, usually for cracking password hashes. Passwords are typically stored not in plain text form, but as hash values. If such
Rainbow_table
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
Class of fingerprinting algorithm
Perceptual hashing is the use of a fingerprinting algorithm that produces a snippet, hash, or fingerprint of various forms of multimedia. A perceptual hash is
Perceptual_hashing
Random data used as an additional input to a hash function
salt is random data fed as an additional input to a one-way function that hashes data, a password or passphrase. Salting helps defend against attacks that
Salt_(cryptography)
Hash function without any collisions
science, a perfect hash function h for a set S is a hash function that maps distinct elements in S to a set of m integers, with no collisions. In mathematical
Perfect_hash_function
Key derivation function
password pairs with collisions within each pair. If a supplied password is longer than the block size of the underlying HMAC hash function, the password
PBKDF2
Hash collision resolution technique
Open addressing, or closed hashing, is a method of collision resolution in hash tables. With this method a hash collision is resolved by probing, or searching
Open_addressing
Probability of shared birthdays
of finding a collision for a hash function, as well as calculating the approximate risk of a hash collision existing within the hashes of a given size
Birthday_problem
Publicly known attacks against cryptographic hash functions
argon2, and balloon. Comparison of cryptographic hash functions Cryptographic hash function Collision attack Preimage attack Length extension attack Cipher
Hash function security summary
Hash_function_security_summary
Algorithmic technique using hashing
nearest neighbor search. It differs from conventional hashing techniques in that hash collisions are maximized, not minimized. Alternatively, the technique
Locality-sensitive_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)
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)
Hash functions
hash function such as SHA is collision-resistant only if the entire output is used. If used to generate a small output, such as an index into a hash table
SipHash
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)
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
Cryptographic hash function
published since then. As of 2007, an attack can generate collisions in less than two MD4 hash operations. A theoretical preimage attack also exists. A
MD4
Cryptographic hash function
function is not collision-free". Journal of Cryptology. 10 (1): 51–69. doi:10.1007/s001459900019. S2CID 15662054. Bosselaers, Antoon. "The hash function RIPEMD-160"
RIPEMD
Cryptographic hash function
solving the discrete logarithm problem. MuHASH is thus a provably secure hash, i.e. we know that finding a collision is at least as hard as some hard known
Elliptic_curve_only_hash
Tables comparing general and technical information for common hashes
the security of a 304-bit hash when looking at preimage attacks, but the security of a 608-bit hash when looking at collision attacks. The 64-bit version
Comparison of cryptographic hash functions
Comparison_of_cryptographic_hash_functions
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
System for dealing with email spam
2000). Penny Black (research project) Anubis (software) "A partial hash collision based postage scheme" (Txt). Hashcash.org. Retrieved 13 October 2014
Hashcash
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
Cryptographic hash function
that finding collisions is as difficult as some known hard mathematical problem. Unlike other provably secure collision-resistant hashes, VSH is efficient
Very_smooth_hash
Cryptographic secret, not public in contrast to salt
password during hashing with a cryptographic hash function. This value differs from a salt in that it is not stored alongside a password hash, but rather
Pepper_(cryptography)
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
Key derivation function based on an HMAC
way that specifically exploits HKDF-Extract's underlying hash function (finding a collision or a specific bias), XTR provides no protection. A random
HKDF
Techniques to protect against brute-force attack
several ways to perform key stretching. One way is to apply a cryptographic hash function or a block cipher repeatedly in a loop. For example, in applications
Key_stretching
Dutch cryptographer (born 1981)
known for his work on cryptographic hash collisions and for the creation of the chosen-prefix hash collision tool HashClash as part of his master's degree
Marc_Stevens_(cryptology)
Data structure hashing scheme
Cuckoo hashing is a scheme in computer programming for resolving hash collisions of values of hash functions in a table, with worst-case constant lookup
Cuckoo_hashing
Concept in cryptography
the hash function being exposed to attacks including collision attacks, length extension attacks, and preimage attacks. Constructing a cipher or hash to
Avalanche_effect
Password-based key derivation function
bcrypt is a password-hashing function designed by Niels Provos and David Mazières. It is based on the Blowfish cipher and presented at USENIX in 1999
Bcrypt
resistance, collision resistance, and pseudo-randomness. Pre-image resistance: given a hash h, it should be hard to find any message m such that h = hash(m).
Security of cryptographic hash functions
Security_of_cryptographic_hash_functions
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
Method of negotiating credentials between web server and browser
keyed-hash message authentication code (HMAC). Although the cryptographic construction that is used is based on the MD5 hash function, collision attacks
Digest_access_authentication
Hopscotch hashing is a scheme in computer programming for resolving hash collisions of values of hash functions in a table using open addressing. It is
Hopscotch_hashing
Practice and study of secure communication techniques
digital signature. For a hash function to be secure, it must be difficult to compute two inputs that hash to the same value (collision resistance) and to compute
Cryptography
Universal hash family used for message authentication in cryptography
Poly1305 is a universal hash family designed by Daniel J. Bernstein in 2002 for use in cryptography. As with any universal hash family, Poly1305 can be
Poly1305
Scheme that defines the format of magnet links
Kazaa hash Used on FastTrack, these hash sums are vulnerable to hash collision attacks. xt=urn:kzhash:[ Kazaa Hash (Hex) ] BitTorrent info hash (BTIH)
Magnet_URI_scheme
Vectorizing features using a hash function
In machine learning, feature hashing, also known as the hashing trick (by analogy to the kernel trick), is a fast and space-efficient way of vectorizing
Feature_hashing
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
a checksum. Hash function security summary Secure Hash Algorithms NIST hash function competition Key derivation functions (category) "Hash functions".
List_of_hash_functions
Cryptographic hash function
to N-hash, and showed that collisions could be generated faster than by a birthday attack for N-hash variants with even up to 12 rounds. N-hash follows
N-hash
Technique for selecting hash functions
a low number of collisions in expectation, even if the data is chosen by an adversary. Many universal families are known (for hashing integers, vectors
Universal_hashing
Network storage system
The risk of accidental hash collision in a 160-bit hash is very small, even for exabytes of data. Historically, however, many hash functions become increasingly
Venti_(software)
Authenticated encryption mode for block ciphers
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
Hash table collision resolution strategy
Coalesced hashing, also called coalesced chaining, is a strategy of collision resolution in a hash table that forms a hybrid of separate chaining and open
Coalesced_hashing
Data mining technique
computer science and data mining, MinHash (or the min-wise independent permutations locality sensitive hashing scheme) is a technique for quickly estimating
MinHash
Russian cryptographic hash function
The GOST hash function, defined in the standards GOST R 34.11-94 and GOST 34.311-95 is a 256-bit cryptographic hash function. It was initially defined
GOST_(hash_function)
Standard for cryptographic certificates
exploit weaknesses in the hash function to forge certificates. Specifically, if an attacker is able to produce a hash collision, they can convince a CA
X.509
2015 password-based key derivation function
derivation function that was selected as the winner of the 2015 Password Hashing Competition. It was designed by Alex Biryukov, Daniel Dinu, and Dmitry
Argon2
Russian cryptographic hash function
Streebog-like hash function, provided with 12 different natural language input messages. AlTawy, et al, found 5-round free-start collision and a 7.75 free-start
Streebog
Cryptography algorithm
internal IV. It derives a hash of the additional authenticated data and plaintext using the POLYVAL Galois hash function. The hash is then encrypted an AES-key
Block cipher mode of operation
Block_cipher_mode_of_operation
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
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)
Infinite binary sequence generated by repeated complementation and concatenation
mapped to 0 by a wide class of polynomial hash functions modulo a power of two, which can lead to hash collisions. Certain linear combinations of Dirichlet
Thue–Morse_sequence
Computer programming technique
Double hashing is a computer programming technique used in conjunction with open addressing in hash tables to resolve hash collisions, by using a secondary
Double_hashing
Theory of cryptography
depends entirely on the transformation function f. In hash applications, resistance to collision or preimage attacks depends on C, and its size (the "capacity"
Sponge_function
same hash value as the valid data and be treated as such. This is known as a hash collision. Torrent and p2p files typically use 160 bit hashes that are
Glossary_of_BitTorrent_terms
Encryption method
effect Hash collision Merkle–Damgård construction Sponge function HAIFA construction Standardization CAESAR Competition CRYPTREC NESSIE NIST hash function
Authenticated_encryption
Topics referred to by the same term
involving one or more trains Hash collision, a computer science term Collision (telecommunications), or network collision Collision (novel), a 2008 thriller
Collision_(disambiguation)
Property of cryptographic hash functions
property of cryptographic hash functions. Not all cryptographic hash functions have this property. SHA-256 is a cryptographic hash function that is thought
Puzzle_friendliness
Computer programming method for hashing
Linear probing is a scheme in computer programming for resolving collisions in hash tables, data structures for maintaining a collection of key–value pairs
Linear_probing
Set of cryptographic algorithms by the NSA
effect Hash collision Merkle–Damgård construction Sponge function HAIFA construction Standardization CAESAR Competition CRYPTREC NESSIE NIST hash function
Commercial National Security Algorithm Suite
Commercial_National_Security_Algorithm_Suite
Hash functions intended for applications that do not need rigorous security
distribution and avalanche properties. Collision resistance is an additional feature that can be useful against hash flooding attacks; simple NCHFs, like
Non-cryptographic hash function
Non-cryptographic_hash_function
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)
Family of cryptographic hash functions
In cryptography, the fast syndrome-based hash functions (FSB) are a family of cryptographic hash functions introduced in 2003 by Daniel Augot, Matthieu
Fast_syndrome-based_hash
Non-cryptographic hash function
same speed makes finding specific hash values (collisions) by brute force faster. Sticky state – Being an iterative hash based primarily on multiplication
Fowler–Noll–Vo_hash_function
System to verify the source and or authenticity of a message
information transmitted between them. It is based on using a cryptographic hash or symmetric encryption algorithm. The authentication key is only shared
Message_authentication
Cryptographic hash function
1109/ASAP.2009.31. S2CID 15221666. Heilman, Ethan (2009-03-12). "Collision for Spectral Hash". Retrieved 19 May 2009. The Spectral Hash web site v t e
Spectral_Hash
Cryptographic hash function
Lane is a cryptographic hash function submitted to the NIST hash function competition; it was designed by Sebastiaan Indesteege with contributions by Elena
Lane_(hash_function)
Search tree data structure
IP routing, offering advantages over hash tables due to their prefix-based organization and lack of hash collisions. Every child node shares a common prefix
Trie
Data processing technique to eliminate duplicate copies of repeating data
and strong hashes. Weak hashes are much faster to calculate but there is a greater risk of a hash collision. Systems that utilize weak hashes will subsequently
Data_deduplication
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
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)
Programming technique for resolving duplicate hash values in a hash table data structure
perfect hashing is a programming technique for resolving collisions in a hash table data structure. While more memory-intensive than its hash table counterparts
Dynamic_perfect_hashing
Cryptographic hash function
The SANDstorm hash is a cryptographic hash function designed in 2008 by Mark Torgerson, Richard Schroeppel, Tim Draelos, Nathan Dautenhahn, Sean Malone
SANDstorm_hash
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
Operation of checking the integrity of file
unmodified. Due to the nature of hash functions, hash collisions may result in false positives, but the likelihood of collisions is often negligible with random
File_verification
Cryptographic primitive
{\displaystyle h} , i.e. hash ( m 1 ) = hash ( m 2 ) {\displaystyle \operatorname {hash} (m_{1})=\operatorname {hash} (m_{2})} . Collision-resistance: It should
One-way_compression_function
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
Data structure holding key/value pairs
outperform alternative implementations. Hash tables must be able to handle collisions: the mapping by the hash function of two different keys to the same
Associative_array
Cryptographic hash function
algorithm is less efficient than most traditional hash functions that do not give a proof of their collision-resistance. Therefore, its practical use would
SWIFFT
Communications protocol
methods of ETag generation include using a collision-resistant hash function of the resource's content, a hash of the last modification timestamp, or even
HTTP_ETag
HASH COLLISION
HASH COLLISION
Boy/Male
Hindu
Eye
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.
Surname or Lastname
English
English : variant of Pask, from the byform pasche, Latin pascha.Americanized spelling of German Pasch.
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.
Boy/Male
Muslim
Acme of mountain
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.
Boy/Male
Hindu
Happiness
Male
English
 Short form of English unisex Ashley, ASH means "ash-tree grove."Â
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.
Boy/Male
American, Australian, British, Chinese, Christian, English
Dweller by the Ash Tree; Adventurer; Cliff
Boy/Male
American, Australian, British, English, Hebrew, Hindu, Indian
From the Ash Tree Farm; Ash Trees Meadow; Felicitous
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 : 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).
Male
Hindi/Indian
(यश) Hindi name YASH means "glory."
Surname or Lastname
English and Scottish
English and Scottish : unexplained.
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
Hindu
God is gracious, Kirti, Good wishes
Surname or Lastname
English
English : variant of Marsh.Americanized spelling of German Masch.Jewish (Ashkenazic) : unexplained; possibly an acronymic name.
Female
Vietnamese
Vietnamese name HANH means "has good conduct."
Girl/Female
Australian, British, Chinese, English, Gujarati, Indian
Form of Ashley; Ash Tree Meadow
HASH COLLISION
HASH COLLISION
Girl/Female
Indian
Boy/Male
German American English
rules; conquers.
Girl/Female
Indian
Girl/Female
Hindi
Pine.
Girl/Female
Arabic, German, Hungarian
Dedicated to God
Boy/Male
Hindu
End
Girl/Female
French, German, Hebrew, Hindu, Indian, Marathi
Pleasure; Delight; In the Bible; Name of Two Israelites of the Returned Community
Girl/Female
Tamil
The Moon
Boy/Male
Tamil
Devashish | தேவாஷீஷ
Blessing of God
Girl/Female
English
Modern feminine of John and Jon.
HASH COLLISION
HASH COLLISION
HASH COLLISION
HASH COLLISION
HASH COLLISION
v. t.
To pay, or to receive, cash for; to exchange for money; as, cash a note or an order.
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.
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.
v. t.
To adorn with a sash or scarf.
n.
A liquid preparation for the hair; as, a hair wash.
n.
To /hop into small pieces; to mince and mix; as, to hash meat.
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.
A sudden check; abashment; frustration; ruin; as, his hopes received a dash.
superl.
Uttered or undertaken with too much haste or too little reflection; as, rash words; rash measures.
a.
Capable of being washed without injury; washable; as, wash goods.
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.
n.
A sash.
n.
Immediate or prompt payment in current funds; as, to sell goods for cash; to make a reduction in price for cash.
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.
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.
v. t.
To strike with a lash ; to whip or scourge with a lash, or with something like one.
n.
A slight admixture, infusion, or adulteration; a partial overspreading; as, wine with a dash of water; red with a dash of purple.
v. t.
To shut or fasten with a hasp.