AI & ChatGPT searches , social queriess for HASH BASED-CRYPTOGRAPHY
Search references for HASH BASED-CRYPTOGRAPHY. Phrases containing HASH BASED-CRYPTOGRAPHY
See searches and references containing HASH BASED-CRYPTOGRAPHY!
Search references for HASH BASED-CRYPTOGRAPHY. Phrases containing HASH BASED-CRYPTOGRAPHY
See searches and references containing HASH BASED-CRYPTOGRAPHY!HASH BASED-CRYPTOGRAPHY
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
Random data used as an additional input to a hash function
In cryptography, a salt is random data fed as an additional input to a one-way function that hashes data, a password or passphrase. Salting helps defend
Salt_(cryptography)
Computer communications authentication algorithm
In cryptography, an HMAC (sometimes expanded as either keyed-hash message authentication code or hash-based message authentication code) is a specific
HMAC
Cryptography secured against quantum computers
cryptographic systems such as Lamport signatures, the Merkle signature scheme, the XMSS, the SPHINCS, the WOTS and the SPHINCS+ schemes. Hash based digital
Post-quantum_cryptography
Type of data structure
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
Merkle_tree
Cryptographic secret, not public in contrast to salt
In cryptography, a pepper is a secret added to an input such as a password during hashing with a cryptographic hash function. This value differs from a
Pepper_(cryptography)
Hash function phenomenon
derived from a hash function which takes a data input and returns a fixed length of bits. Although hash algorithms, especially cryptographic hash algorithms
Hash_collision
Hash function that is suitable for use in cryptography
such search is quantified as security strength: a cryptographic hash with n {\displaystyle n} bits of hash value is expected to have a preimage resistance
Cryptographic_hash_function
Information used for message authentication and integrity checking
even faster than universal-hashing based MACs. Additionally, the MAC algorithm can deliberately combine two or more cryptographic primitives, so as to maintain
Message_authentication_code
Practice and study of secure communication techniques
often used, in which a cryptographic hash function is computed, and only the resulting hash is digitally signed. Cryptographic hash functions are functions
Cryptography
Tables comparing general and technical information for common hashes
tables compare general and technical information for a number of cryptographic hash functions. See the individual functions' articles for further information
Comparison of cryptographic hash functions
Comparison_of_cryptographic_hash_functions
Cryptographic hash function
(SM3) is a cryptographic hash function, standardised for use in commercial cryptography in China. It was published by the State Cryptography Administration
SM3_(hash_function)
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
N-hash
Attack against cryptographical hash functions
In cryptography and computer security, a length extension attack is a type of attack where an attacker can use Hash(message1) and the length of message1
Length_extension_attack
Message-digest hashing algorithm
a cryptographic hash function; however it has been found to suffer from extensive vulnerabilities. It remains suitable for other non-cryptographic purposes
MD5
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)
Obsolete cryptographic hash function
The MD2 Message-Digest Algorithm is an obsolete cryptographic hash function developed by Ronald Rivest in 1989. The algorithm is optimized for 8-bit computers
MD2_(hash_function)
Cryptographic key management algorithm
session keys. It combines a cryptographic so-called "ratchet" based on the Diffie–Hellman key exchange (DH) and a ratchet based on a key derivation function
Double_Ratchet_Algorithm
Algorithm for public-key cryptography
cryptosystem) such as RSAES-OAEP, and public-key key encapsulation. In RSA-based cryptography, a user's private key—which can be used to sign messages, or decrypt
RSA_cryptosystem
Attack model against cryptographic hash functions
In cryptography, a preimage attack on cryptographic hash functions tries to find a message that has a specific hash value. A cryptographic hash function
Preimage_attack
Concept in cryptography
In cryptography, the avalanche effect is the desirable property of cryptographic algorithms, typically block ciphers and cryptographic hash functions,
Avalanche_effect
Method of producing many one-time keys from a single key
A hash chain is the successive application of a cryptographic hash function to a piece of data. In computer security, a hash chain is a method used to
Hash_chain
Post-quantum digital signature scheme
digital signature scheme that is based on cryptographic hash functions. As a part of the NIST Post-Quantum Cryptography Standardization process, a version
SPHINCS+
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
Non-cryptographic hash function
(or FNV) is a non-cryptographic hash function created by Glenn Fowler, Landon Curt Noll, and Kiem-Phong Vo. The basis of the FNV hash algorithm was taken
Fowler–Noll–Vo_hash_function
Mathematical scheme for verifying the authenticity of digital documents
2024-09-18. Naor, Moni; Yung, Moti (1989). "Universal one-way hash functions and their cryptographic applications". Proceedings of the twenty-first annual ACM
Digital_signature
Cryptographic hash function
In computer science and cryptography, Whirlpool (sometimes styled WHIRLPOOL) is a cryptographic hash function. It was designed by Vincent Rijmen (co-creator
Whirlpool_(hash_function)
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)
Techniques to protect against brute-force attack
are 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
Cryptographic hash function
In cryptography, Tiger is a cryptographic hash function designed by Ross Anderson and Eli Biham in 1995 for efficiency on 64-bit platforms. The size of
Tiger_(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
Cryptographic attack
In 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
Key derivation function based on an HMAC
Such extractors can be built using cryptographic functions under suitable assumptions, modeled as universal hash function (in the generic case) or a
HKDF
Set of cryptographic hash functions
SHA-0 and SHA-1, NIST perceived a need for an alternative, dissimilar cryptographic hash, which became SHA-3. After a setup period, admissions were to be submitted
SHA-3
Cryptographic hash function
function. In 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
SHA-1
Publicly known attacks against cryptographic hash functions
publicly known attacks against cryptographic hash functions. Note that not all entries may be up to date. For a summary of other hash function parameters, see
Hash function security summary
Hash_function_security_summary
Method of building collision-resistant cryptographic hash functions
In cryptography, the Merkle–Damgård construction or Merkle–Damgård hash function is a method of building collision-resistant cryptographic hash functions
Merkle–Damgård_construction
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)
Hash functions
comparable to non-cryptographic hash functions, such as CityHash; this can be used to prevent denial-of-service attacks against hash tables ("hash flooding")
SipHash
Cryptographic hash function
RIPEMD (RIPE Message Digest) is a family of cryptographic hash functions developed in 1992 (the original RIPEMD) and 1996 (other variants). There are five
RIPEMD
Key derivation function
In cryptography, PBKDF1 and PBKDF2 (Password-Based Key Derivation Function 1 and 2) are key derivation functions with a sliding computational cost, used
PBKDF2
Cryptographic algorithm for digital signatures
follows these steps: Calculate e = HASH ( m ) {\displaystyle e={\textrm {HASH}}(m)} . (Here HASH is a cryptographic hash function, such as SHA-2, with the
Elliptic Curve Digital Signature Algorithm
Elliptic_Curve_Digital_Signature_Algorithm
Cryptography primitive
Panama is a cryptographic primitive which can be used both as a hash function and a stream cipher, but its hash function mode of operation has been broken
Panama_(cryptography)
Cryptographic primitive
functions are for instance used in the Merkle–Damgård construction inside cryptographic hash functions. One-way compression functions are often built from block
One-way_compression_function
Authenticated encryption with associated data algorithm
including using Chacha20 instead of Salsa20 and using a universal hashing based MAC for performance. The outcome of this process was the adoption of
ChaCha20-Poly1305
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
Russian cryptographic hash function
Стрибог) is a cryptographic hash function defined in the Russian national standard GOST R 34.11-2012 Information Technology – Cryptographic Information
Streebog
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)
Authenticated encryption mode
In cryptography, Galois/Counter Mode (GCM) is a mode of operation for symmetric-key cryptographic block ciphers that provides both encryption and message
Galois/Counter_Mode
Short sequence of bytes used to authenticate or look up a longer public key
identify a longer public key. Fingerprints are created by applying a cryptographic hash function to a public key. Since fingerprints are shorter than the
Public_key_fingerprint
Type of cryptographic attack
attack BHT Algorithm "Avoiding collisions, Cryptographic hash functions" (PDF). Foundations of Cryptography, Computer Science Department, Wellesley College
Birthday_attack
Password cracking dataset
outputs of a cryptographic hash function, usually for cracking password hashes. Passwords are typically stored not in plain text form, but as hash values.
Rainbow_table
Hash functions intended for applications that do not need rigorous security
The non-cryptographic hash functions (NCHFs) are hash functions intended for applications that do not need the rigorous security requirements of the cryptographic
Non-cryptographic hash function
Non-cryptographic_hash_function
System that regulates the formation of blocks on a blockchain
work (also written as proof-of-work, and abbreviated PoW) is a form of cryptographic proof in which one party (the prover) proves to others (the verifiers)
Proof_of_work
Project by NIST to standardize post-quantum cryptography
schemes Lattice-based cryptography NIST hash function competition "Post-Quantum Cryptography PQC". 3 January 2017. "Post-Quantum Cryptography Standardization
NIST Post-Quantum Cryptography Standardization
NIST_Post-Quantum_Cryptography_Standardization
Cryptanalytic method for unauthorized users to access data
In cryptography, a brute-force attack or exhaustive key search is a cryptanalytic attack that consists of an attacker submitting many possible keys or
Brute-force_attack
Cryptographic signature scheme
Lamport signatures can be built from any cryptographically secure one-way function; usually, a cryptographic hash function is used. Although the potential
Lamport_signature
Digital verification standard
phase computes a single key pair for one user. Choose an approved cryptographic hash function H {\displaystyle H} with output length | H | {\displaystyle
Digital_Signature_Algorithm
Mechanism for authenticating cryptographic keys
In cryptography, a web of trust is a concept used in PGP, GnuPG, and other OpenPGP-compatible systems to establish the authenticity of the binding between
Web_of_trust
Topics referred to by the same term
XMSS may refer to: Extended Merkle signature scheme, a type of hash-based cryptography Xinmin Secondary School, a secondary school in Hougang, Singapore
XMSS
Property of cryptographic hash functions
In cryptography, puzzle friendliness is a property of cryptographic hash functions. Not all cryptographic hash functions have this property. SHA-256 is
Puzzle_friendliness
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 primitives that involve lattices
hard to solve as a worst-case lattice problem. She then showed a cryptographic hash function whose security is equivalent to the computational hardness
Lattice-based_cryptography
Augmented password-authenticated key exchange protocol
Diffie–Hellman key exchange based on the client side having the user password and the server side having a cryptographic verifier derived from the password
Secure Remote Password protocol
Secure_Remote_Password_protocol
Public-key cryptosystem
In cryptography, the ElGamal encryption system is a public-key encryption algorithm based on the Diffie–Hellman key exchange. It was described by Taher
ElGamal_encryption
Scheme often used with RSA encryption
In cryptography, optimal asymmetric encryption padding (OAEP) is a padding scheme often used together with RSA encryption. OAEP was introduced by Bellare
Optimal asymmetric encryption padding
Optimal_asymmetric_encryption_padding
Approach to public-key cryptography
Elliptic-curve cryptography (ECC) is an approach to public-key cryptography based on the algebraic structure of elliptic curves over finite fields. ECC
Elliptic-curve_cryptography
Computer function
MurmurHash is a non-cryptographic hash function suitable for general hash-based lookup. It was created by Austin Appleby in 2008 and, as of 8 January
MurmurHash
Competition to develop SHA-3
round of the SHA-3 Cryptographic Hash Algorithm Competition (PDF). Status Report on the second round of the SHA-3 Cryptographic Hash Algorithm Competition
NIST hash function competition
NIST_hash_function_competition
Function that derives secret keys from a secret value
passphrase using a pseudorandom function (which typically uses a cryptographic hash function or block cipher). KDFs can be used to stretch keys into longer
Key_derivation_function
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
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
Theory of cryptography
uses. They can be used to model or implement many cryptographic primitives, including cryptographic hashes, message authentication codes, mask generation
Sponge_function
cryptography, cryptographic hash functions can be divided into two main categories. In the first category are those functions whose designs are based
Security of cryptographic hash functions
Security_of_cryptographic_hash_functions
Digital signature scheme
be hard. Typically a Schnorr group is used. All users agree on a cryptographic hash function H : { 0 , 1 } ∗ → Z / q Z {\displaystyle H:\{0,1\}^{*}\rightarrow
Schnorr_signature
Identity-based cryptography is a type of public-key cryptography in which a publicly known string representing an individual or organization is used as
Identity-based_cryptography
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)
System to verify the source and or authenticity of a message
check based on a secret key shared by two parties to authenticate information transmitted between them. It is based on using a cryptographic hash or symmetric
Message_authentication
Design method for cryptographic hash functions
The HAIFA construction (hash iterative framework) is a cryptographic structure used in the design of hash functions. It is one of the modern alternatives
HAIFA_construction
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
Basic cryptographic algorithm used to build cryptographic protocols
not limited to, one-way hash functions and encryption functions. When creating cryptographic systems, designers use cryptographic primitives as their most
Cryptographic_primitive
Algorithm for public key cryptography
Paillier in 1999, is a probabilistic asymmetric algorithm for public key cryptography. The problem of computing n-th residue classes is believed to be computationally
Paillier_cryptosystem
Digital signature scheme
{\displaystyle N} -bit prime number p {\displaystyle p} Choose a cryptographic hash function H {\displaystyle H} with output length L {\displaystyle L}
ElGamal_signature_scheme
Cryptography, the use of codes and ciphers, began thousands of years ago. Until recent decades, it has been the story of what might be called classical
History_of_cryptography
Cryptographic hash function
Shabal is a cryptographic hash function submitted by the France-funded research project Saphir to NIST's international competition on hash functions. The
Shabal
Message authentication code algorithm
In cryptography, a cipher block chaining message authentication code (CBC-MAC) is a technique for constructing a message authentication code (MAC) from
CBC-MAC
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
Non-federated cryptographic protocol
Protocol (formerly known as the TextSecure Protocol) is a non-federated cryptographic protocol that provides end-to-end encryption for voice and instant messaging
Signal_Protocol
Cryptographic hash function
Grøstl is a cryptographic hash function submitted to the NIST hash function competition by Praveen Gauravaram, Lars Knudsen, Krystian Matusiewicz, Florian
Grøstl
Non-commutative cryptography is the area of cryptology where the cryptographic primitives, methods and systems are based on algebraic structures like semigroups
Non-commutative_cryptography
Hyperelliptic curve cryptography is similar to elliptic curve cryptography (ECC) insofar as the Jacobian of a hyperelliptic curve is an abelian group in
Hyperelliptic curve cryptography
Hyperelliptic_curve_cryptography
Used for encoding or decoding ciphertext
file, which, when processed through a cryptographic algorithm, can encode or decode cryptographic data. Based on the used method, the key can be different
Key_(cryptography)
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
Type of message authentication code
In cryptography, a universal hashing message authentication code, or UMAC, is a message authentication code (MAC) calculated using universal hashing, which
UMAC_(cryptography)
Single-use value in secure communications
initialization vectors and in cryptographic hash functions. A nonce is an arbitrary number used only once in a cryptographic communication, in the spirit
Cryptographic_nonce
Cryptographic hash function
In cryptography, Very Smooth Hash (VSH) is a provably secure cryptographic hash function invented in 2005 by Scott Contini, Arjen Lenstra, and Ron Steinfeld
Very_smooth_hash
Type of cryptosystem
A threshold cryptosystem, the basis for the field of threshold cryptography, is a cryptosystem in which the secret key is split into a number of pieces
Threshold_cryptosystem
Multiparty cryptographic process
Distributed key generation (DKG) is a cryptographic process in which multiple parties contribute to the calculation of a shared public and private key
Distributed_key_generation
Post-quantum digital signature scheme
{\displaystyle E_{2}} . The fundamental problem that isogeny-based cryptography like SQIsign is based on is called the isogeny path problem and can be formulated
SQIsign
Cryptographic method
verifications per second. Post-quantum cryptography Lattice-based cryptography NTRU NIST Post-Quantum Cryptography Standardization Official website Thomas
Falcon_(signature_scheme)
HASH BASED-CRYPTOGRAPHY
HASH BASED-CRYPTOGRAPHY
Girl/Female
Australian, British, Chinese, English, Gujarati, Indian
Form of Ashley; Ash Tree Meadow
Female
Vietnamese
Vietnamese name HANH means "has good conduct."
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
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 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.
Girl/Female
British, English
Based
Boy/Male
Arabic, Australian
Smiling
Male
English
 Short form of English unisex Ashley, ASH means "ash-tree grove."Â
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’.
Girl/Female
English
Modern name based on Jane or Jean; Based on Janai meaning 'God has answered. '.
Boy/Male
Muslim/Islamic
Brave
Boy/Male
Muslim
Smiling
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
Afghan, African, Arabic, Australian, Chinese, Greek, Indian, Muslim
Brave
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 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 : 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."
Boy/Male
American, Australian, British, English, Hebrew, Hindu, Indian
From the Ash Tree Farm; Ash Trees Meadow; Felicitous
Boy/Male
Muslim/Islamic
Smiling
HASH BASED-CRYPTOGRAPHY
HASH BASED-CRYPTOGRAPHY
Boy/Male
Greek
Son of Zeus; grandfather of Achilles.
Boy/Male
Indian
One of the prophet muhammads names, Sura in Quran
Boy/Male
Indian, Sanskrit
Freedom from Sin; Pious; Pure
Boy/Male
Muslim
Servant of the Opener (of the gates of sustenance).
Surname or Lastname
English
English : unexplained.
Boy/Male
Arabic, Bengali, Hindu, Indian, Muslim, Telugu
Snake
Girl/Female
Hindu
Girl
Girl/Female
Tamil
Maandhari | மாநà¯à®¤à®¾à®°à¯€
Honourable
Boy/Male
Muslim
Giving alms. Donation.
Girl/Female
American, Australian, British, Chinese, Christian, English, Jamaican, Latin
Poppy; Flower Name; From the Flower
HASH BASED-CRYPTOGRAPHY
HASH BASED-CRYPTOGRAPHY
HASH BASED-CRYPTOGRAPHY
HASH BASED-CRYPTOGRAPHY
HASH BASED-CRYPTOGRAPHY
v. t.
To pay, or to receive, cash for; to exchange for money; as, cash a note or an order.
a.
Deep or grave in sound; as, the base tone of a violin.
a.
Alloyed with inferior metal; debased; as, base coin; base bullion.
a.
Having a base, or having as a base; supported; as, broad-based.
n.
Wearing, or protected by, bases.
n.
A sash.
n.
A pie; baked food.
a.
Not held by honorable service; as, a base estate, one held by services not honorable; held by villenage. Such a tenure is called base, or low, and the tenant, a base tenant.
v. t.
To strike with a lash ; to whip or scourge with a lash, or with something like one.
imp. & p. p.
of Base
v. t.
To adorn with a sash or scarf.
superl.
Uttered or undertaken with too much haste or too little reflection; as, rash words; rash measures.
v. t.
To furnish with a sash or sashes; as, to sash a door or a window.
a.
Reduced; lowered; restrained; as, to speak with bated breath.
v. t.
To shut or fasten with a hasp.
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.
3d pers. sing. pres.
Has.
n.
A rustic play; -- called also prisoner's base, prison base, or bars.
n.
To /hop into small pieces; to mince and mix; as, to hash meat.
a.
Morally low. Hence: Low-minded; unworthy; without dignity of sentiment; ignoble; mean; illiberal; menial; as, a base fellow; base motives; base occupations.