AI & ChatGPT searches , social queriess for CRYPTOGRAPHIC HASH-FUNCTION
Search references for CRYPTOGRAPHIC HASH-FUNCTION. Phrases containing CRYPTOGRAPHIC HASH-FUNCTION
See searches and references containing CRYPTOGRAPHIC HASH-FUNCTION!
Search references for CRYPTOGRAPHIC HASH-FUNCTION. Phrases containing CRYPTOGRAPHIC HASH-FUNCTION
See searches and references containing CRYPTOGRAPHIC HASH-FUNCTION!CRYPTOGRAPHIC HASH-FUNCTION
Hash function that is suitable for use in cryptography
cryptography, the security level of a cryptographic hash function has been defined using the following properties: Pre-image resistance Given a hash value
Cryptographic_hash_function
Tables comparing general and technical information for common hashes
general and technical information for a number of cryptographic hash functions. See the individual functions' articles for further information. This article
Comparison of cryptographic hash functions
Comparison_of_cryptographic_hash_functions
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 functions intended for applications that do not need rigorous security
other cryptographic primitives); in this case they are described as universal hash functions. Among the typical uses of non-cryptographic hash functions are
Non-cryptographic hash function
Non-cryptographic_hash_function
Function that derives secret keys from a secret value
password, or a passphrase using a pseudorandom function (which typically uses a cryptographic hash function or block cipher). KDFs can be used to stretch
Key_derivation_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)
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)
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
Computer communications authentication algorithm
of message authentication code (MAC) involving a cryptographic hash function and a secret cryptographic key. As with any MAC, it may be used to simultaneously
HMAC
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
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
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)
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)
Attack model against cryptographic hash functions
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
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
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
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)
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
This is a list of hash functions, including cyclic redundancy checks, checksum functions, and cryptographic hash functions. Adler-32 is often mistaken
List_of_hash_functions
Publicly known attacks against cryptographic hash functions
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 comparison
Hash function security summary
Hash_function_security_summary
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
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
Measure of cryptographic strength
In cryptography, security level is a measure of the strength that a cryptographic primitive — such as a cipher or hash function — achieves. Security level
Security_level
Cryptographic hash function
SHA-1 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
SHA-1
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)
Competition to develop SHA-3
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
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)
Information used for message authentication and integrity checking
MAC algorithms can be constructed from other cryptographic primitives, like cryptographic hash functions (as in the case of HMAC) or from block cipher
Message_authentication_code
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
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
List of data hashes
top hash of an MD4 hash list to uniquely identify a file Cryptographic hash function List Clark, Liat. "Child sexual abuse 'hash lists' shared with internet
Hash_list
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)
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
Cryptographic primitive
compression functions are for instance used in the Merkle–Damgård construction inside cryptographic hash functions. One-way compression functions are often
One-way_compression_function
Theory of cryptography
Sponge functions have both theoretical and practical uses. They can be used to model or implement many cryptographic primitives, including cryptographic hashes
Sponge_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
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)
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
In 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
Technique for selecting hash functions
universal hashing (in a randomized algorithm or data structure) refers to selecting a hash function at random from a family of hash functions with a certain
Universal_hashing
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
Practice and study of secure communication techniques
and so has been thought worth the effort. Cryptographic hash functions are a third type of cryptographic algorithm. They take a message of any length
Cryptography
Concept in cryptography
In cryptography, the avalanche effect is the desirable property of cryptographic algorithms, typically block ciphers and cryptographic hash functions, wherein
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
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
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 random
HKDF
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
Set of cryptographic hash functions
function, not (yet) standardized by NIST, including a stream cipher, an authenticated encryption system, a "tree" hashing scheme for faster hashing on
SHA-3
Collection of hash functions
The Jenkins hash functions are a family of non-cryptographic hash functions for multi-byte keys designed by Bob Jenkins. The first one was formally published
Jenkins_hash_function
Short sequence of bytes used to authenticate or look up a longer public key
a longer public key. Fingerprints are created by applying a cryptographic hash function to a public key. Since fingerprints are shorter than the keys
Public_key_fingerprint
Random number generator
This data is then processed with a cryptographic hash function to produce a high-quality seed for a cryptographically-secure pseudorandom number generator
Lavarand
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)
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
Ukrainian cryptographic hash function
a cryptographic hash function defined in the Ukrainian national standard DSTU 7564:2014. It was created to replace an obsolete GOST hash function defined
Kupyna
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
is a family of cryptographic hash functions developed in 1992 (the original RIPEMD) and 1996 (other variants). There are five functions in the family:
RIPEMD
Saarepera based on their research on the security properties of cryptographic hash functions and hash-linking based digital timestamping. Their design goal was
Hash_calendar
Ability to easily switch cryptographic primitives
In cryptographic protocol design, cryptographic agility or crypto-agility is the ability to switch between multiple cryptographic primitives. A cryptographically
Cryptographic_agility
Used for encoding or decoding ciphertext
stored in a file, which, when processed through a cryptographic algorithm, can encode or decode cryptographic data. Based on the used method, the key can be
Key_(cryptography)
Cryptographic hash function
HAVAL is a cryptographic hash function. Unlike MD5, but like most modern cryptographic hash functions, HAVAL can produce hashes of different lengths –
HAVAL
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
Function computed by two parties that emulates a random oracle
An oblivious pseudorandom function (OPRF) is a cryptographic function, similar to a keyed-hash function, but with the distinction that in an OPRF two
Oblivious pseudorandom function
Oblivious_pseudorandom_function
Cryptographic signature scheme
signatures can be built from any cryptographically secure one-way function; usually, a cryptographic hash function is used. Although the potential development
Lamport_signature
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
Pepper_(cryptography)
Cryptographic algorithm for digital signatures
these steps: Calculate e = HASH ( m ) {\displaystyle e={\textrm {HASH}}(m)} . (Here HASH is a cryptographic hash function, such as SHA-2, with the output
Elliptic Curve Digital Signature Algorithm
Elliptic_Curve_Digital_Signature_Algorithm
Key derivation function
published in 2017, recommends PBKDF2 for password hashing. PBKDF2 applies a pseudorandom function, such as hash-based message authentication code (HMAC), to
PBKDF2
Digital identifier derived from the data by an algorithm
Fingerprint functions may be seen as high-performance hash functions used to uniquely identify substantial blocks of data where cryptographic hash functions may
Fingerprint_(computing)
Cryptographic primitives that involve lattices
to solve as a worst-case lattice problem. She then showed a cryptographic hash function whose security is equivalent to the computational hardness of
Lattice-based_cryptography
Cryptographic hash function
[citation needed] standardized in ISO 10118-2) is a cryptographic hash function. MDC-2 is a hash function based on a block cipher with a proof of security
MDC-2
Cryptographic hash function
satisfies many desirable cryptographic and statistical properties, it was not designed to be an "all-purpose" cryptographic hash function. For example, it is
SWIFFT
Cryptographic key management algorithm
soon as a new common secret is established, a new hash ratchet gets initialized. As cryptographic primitives, the Double Ratchet Algorithm uses for the
Double_Ratchet_Algorithm
Bcrypt BLAKE (hash function) Block cipher mode of operation Blowfish (cipher) ChaCha20-Poly1305 Cryptographic hash function Cryptographically secure pseudorandom
List of cryptographic software
List_of_cryptographic_software
Type of authentication protocol
implement a true nonce, a strong cryptographically secure pseudorandom number generator and cryptographic hash function can generate challenges that are
Challenge–response authentication
Challenge–response_authentication
Fast 8-bit hash function
Pearson hashing is a non-cryptographic hash function designed for fast execution on processors with 8-bit registers. Given an input consisting of any number
Pearson_hashing
Cryptographic model of a random function
using weaker assumptions on the cryptographic hash function. A system that is proven secure when every hash function is replaced by a random oracle is
Random_oracle
Reliable digital data delivery methods on unreliable channels
bit can be seen as a special-case 1-bit CRC. The output of a cryptographic hash function, also known as a message digest, can provide strong assurances
Error detection and correction
Error_detection_and_correction
Data used to detect errors in other data
corrupted. Checksum functions are related to hash functions, fingerprints, randomization functions, and cryptographic hash functions. However, each of those
Checksum
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
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
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
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
Cryptographic tool
mask generation function (MGF) is a cryptographic primitive similar to a cryptographic hash function except that while a hash function's output has a fixed
Mask_generation_function
Adding data to a message prior to encryption to hide its length
difficult. Most modern cryptographic hash functions process messages in fixed-length blocks; all but the earliest hash functions include some sort of padding
Padding_(cryptography)
Computational concept
Randomness extractors are used widely in cryptographic applications, whereby a cryptographic hash function is applied to a high-entropy, but non-uniform
Randomness_extractor
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
Cryptographic hash primitive
the NIST Second Cryptographic Hash Workshop, held in Santa Barbara, California, on August 24–25, 2006, as part of the NIST hash function competition. The
RadioGatún
Digital signature scheme
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
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)
Password that can only be used once
pseudorandomness or randomness to generate a shared key or seed, and cryptographic hash functions, which can be used to derive a value but are hard to reverse
One-time_password
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
Lane_(hash_function)
Term applied to cryptographic systems that are highly resistant to cryptanalysis
Strong cryptography or cryptographically strong are general terms used to designate the cryptographic algorithms that, when used correctly, provide a very
Strong_cryptography
Family of authenticated ciphers
authenticated ciphers and hash functions that have been selected by the U.S. National Institute of Standards and Technology (NIST) for cryptography on resource-constrained
Ascon_(cipher)
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
Algorithm for public-key cryptography
Cryptographic Computations". Journal of Cryptology. 14 (2): 106–107. doi:10.1007/s001450010016. ISSN 0933-2790. Isom, Kyle. "Practical Cryptography With
RSA_cryptosystem
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
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 of
SPHINCS+
Collection of efficiently-computable functions which emulate a random oracle
pseudorandom function, abbreviated OPRF, information is concealed from two parties that are involved in a PRF. That is, if Alice cryptographically hashes her secret
Pseudorandom_function_family
Block cipher
benefit has contributed to its popularity in cryptographic software. bcrypt is a password hashing function which, combined with a variable number of iterations
Blowfish_(cipher)
Cryptographic hash function
For a cryptographic hash function (a mathematical algorithm), a MASH-1 (Modular Arithmetic Secure Hash) is a hash function based on modular arithmetic
MASH-1
Digital verification standard
computes a single key pair for one user. Choose an approved cryptographic hash function H {\displaystyle H} with output length | H | {\displaystyle |H|}
Digital_Signature_Algorithm
CRYPTOGRAPHIC HASH-FUNCTION
CRYPTOGRAPHIC HASH-FUNCTION
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.
Boy/Male
Hindu
Eye
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’.
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.
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 : 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.
Female
Vietnamese
Vietnamese name HANH means "has good conduct."
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 Pask, from the byform pasche, Latin pascha.Americanized spelling of German Pasch.
Boy/Male
American, Australian, British, Chinese, Christian, English
Dweller by the Ash Tree; Adventurer; Cliff
Male
English
 Short form of English unisex Ashley, ASH means "ash-tree grove."Â
Boy/Male
American, Australian, British, English, Hebrew, Hindu, Indian
From the Ash Tree Farm; Ash Trees Meadow; Felicitous
Boy/Male
Hindu
God is gracious, Kirti, Good wishes
Boy/Male
Muslim
Acme of mountain
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 and Scottish
English and Scottish : unexplained.
Boy/Male
Hindu
Happiness
Male
Hindi/Indian
(यश) Hindi name YASH means "glory."
Girl/Female
Australian, British, Chinese, English, Gujarati, Indian
Form of Ashley; Ash Tree Meadow
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).
CRYPTOGRAPHIC HASH-FUNCTION
CRYPTOGRAPHIC HASH-FUNCTION
Boy/Male
Arabic
Unique
Female
Japanese
(å’²å) Japanese name SAKIKO means "blossoming child; earlier child."
Boy/Male
Australian, French, Italian, Portuguese
Safe; Peace; Saint Elmo
Girl/Female
Gujarati, Indian
Divine
Boy/Male
Indian, Punjabi, Sikh
Village; Establishment
Girl/Female
Indian
Name of Goddess Parvati
Girl/Female
Welsh Irish
Dark.
Girl/Female
American, Australian, Danish, Greek
Violet Coloured Flower; Violet Flower
Boy/Male
Hindu
One whop confers happiness
Male
French
 Later form of Norman French Godard, GODDARD means "god-strong." Compare with another form of Goddard.
CRYPTOGRAPHIC HASH-FUNCTION
CRYPTOGRAPHIC HASH-FUNCTION
CRYPTOGRAPHIC HASH-FUNCTION
CRYPTOGRAPHIC HASH-FUNCTION
CRYPTOGRAPHIC HASH-FUNCTION
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.
To /hop into small pieces; to mince and mix; as, to hash meat.
n.
A cipher writing. Same as Cryptograph.
superl.
Uttered or undertaken with too much haste or too little reflection; as, rash words; rash measures.
n.
One skilled in steganography; a cryptographer.
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 shut or fasten with a hasp.
n.
A slight admixture, infusion, or adulteration; a partial overspreading; as, wine with a dash of water; red with a dash of purple.
a.
Relating to cryptography; written in secret characters or in cipher, or with sympathetic ink.
v. t.
To strike with a lash ; to whip or scourge with a lash, or with something like one.
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.
a.
Pertaining to cryptography; cryptographical.
a.
Alt. of Cryptographical
n.
Same as Cryptographer.
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 sash.
v. t.
To adorn with a sash or scarf.
a.
Capable of being washed without injury; washable; as, wash goods.
v. t.
To furnish with a sash or sashes; as, to sash a door or a window.