Searches , social queries 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
A cryptographic hash function (CHF) is a hash algorithm (a map of an arbitrary binary string to a binary string with a fixed size of n {\displaystyle
Cryptographic_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
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
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)
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
Hash function phenomenon
collision resistance). The typical uses of non-cryptographic hash functions (NCHFs) – like bloom filters, hash tables, count sketches – are less sensitive
Hash_collision
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
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
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
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)
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
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
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)
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)
Message-digest hashing algorithm
as a cryptographic hash function. By the early 21st century, due to low security strength and vulnerabilities, it became unusable for cryptographic applications
MD5
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
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)
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
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)
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
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 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
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)
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
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
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
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
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
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
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)
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
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
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
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)
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
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
Cryptographic hash 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 a message
SHA-1
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
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
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
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
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
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
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
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
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
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
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)
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 hash function
LSH is a cryptographic hash function designed in 2014 by South Korea to provide integrity in general-purpose software environments such as PCs and smart
LSH_(hash_function)
Cryptographic hash function
SIMD is a cryptographic hash function based on the Merkle–Damgård construction submitted to the NIST hash function competition by Gaëtan Leurent. It is
SIMD_(hash_function)
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
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
Practice and study of secure communication techniques
a cryptographic hash function is computed, and only the resulting hash is digitally signed. Cryptographic hash functions are a form of cryptographic anchor
Cryptography
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
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 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
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 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)
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
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 research
Shabal
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
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
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 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
HAVAL is a cryptographic hash function. Unlike MD5, but like most modern cryptographic hash functions, HAVAL can produce hashes of different lengths –
HAVAL
Property of cryptographic hash functions
In cryptography, puzzle friendliness is a property of some cryptographic hash functions. SHA-256 is a cryptographic hash function that is thought to have
Puzzle_friendliness
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
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
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
Grøstl is a cryptographic hash function submitted to the NIST hash function competition by Praveen Gauravaram, Lars Knudsen, Krystian Matusiewicz, Florian
Grøstl
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)
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
Computing algorithm
PJW hash function is a non-cryptographic hash function created by Peter J. Weinberger of AT&T Bell Labs. A variant of PJW hash had been used to create
PJW_hash_function
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)
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
System to verify the source and or authenticity of a message
authenticate information transmitted between them. It is based on using a cryptographic hash or symmetric encryption algorithm. The authentication key is only
Message_authentication
Cryptographic hash extension
function (XOF) is a type of cryptographic hash function that allows its output to be arbitrarily long, allowing it to be used as a cryptographically secure
Extendable-output_function
Property of cryptographic hash functions
In cryptography, collision resistance is a property of cryptographic hash functions (CHFs): a hash function H is collision-resistant if it is hard to find
Collision_resistance
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)
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
Cryptographic key management algorithm
combines a cryptographic so-called "ratchet" based on the Diffie–Hellman key exchange (DH) and a ratchet based on a key derivation function (KDF), such
Double_Ratchet_Algorithm
Cryptographic hash function
Snefru is a cryptographic hash function invented by Ralph Merkle in 1990 while working at Xerox PARC. The function supports 128-bit and 256-bit output
Snefru
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
Function used in computer cryptography
cryptography, quantum digital signatures, quantum money, and other quantum cryptographic protocols. One-way compression function Cryptographic hash function
One-way_function
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 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
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
Cryptography secured against quantum computers
current public-key algorithms, most current symmetric cryptographic algorithms and hash functions are considered to be relatively secure against attacks
Post-quantum_cryptography
Digital verification standard
approved cryptographic hash function H with output length |H| bits. In the original DSS, H was always SHA-1, but the stronger SHA-2 hash functions are approved
Digital_Signature_Algorithm
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
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
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
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)
Deleting data by deleting encryption keys
Crypto-shredding or crypto erase (cryptographic erasure) is the practice of rendering encrypted data unusable by deliberately deleting or overwriting
Crypto-shredding
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
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
padding scheme. It is critical for cryptographic hash functions to employ termination schemes that prevent a hash from being vulnerable to length extension
Padding_(cryptography)
travel, tourism, insurance
CRYPTOGRAPHIC HASH-FUNCTION
CRYPTOGRAPHIC HASH-FUNCTION
CRYPTOGRAPHIC HASH-FUNCTION
CRYPTOGRAPHIC HASH-FUNCTION
CRYPTOGRAPHIC HASH-FUNCTION
CRYPTOGRAPHIC HASH-FUNCTION
CRYPTOGRAPHIC HASH-FUNCTION
CRYPTOGRAPHIC HASH-FUNCTION
CRYPTOGRAPHIC HASH-FUNCTION
travel, tourism, insurance