Search references for SIMD HASH-FUNCTION. Phrases containing SIMD HASH-FUNCTION
See searches and references containing SIMD HASH-FUNCTION!SIMD 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)
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
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)
Competition to develop SHA-3
Midnight Wish CubeHash (Bernstein) ECHO (France Telecom) Fugue (IBM) Hamsi Luffa Shabal SHAvite-3 SIMD The following hash function submissions were accepted
NIST hash function competition
NIST_hash_function_competition
Hash functions
to a spate of "hash flooding" denial-of-service attacks (HashDoS) in late 2011. SipHash is designed as a secure pseudorandom function and can also be
SipHash
Tables comparing general and technical information for common hashes
hash function security/cryptanalysis can be found at hash function security summary. Basic general information about the cryptographic hash functions:
Comparison of cryptographic hash functions
Comparison_of_cryptographic_hash_functions
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)
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
Computer communications authentication algorithm
type 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
Hash function phenomenon
derived from a hash function which takes a data input and returns a fixed length of bits. Hash is typically used as a many-to-one function, with the number
Hash_collision
Publicly known attacks against cryptographic hash functions
cryptographic hash functions. Note that not all entries may be up to date. For a summary of other hash function parameters, see comparison of cryptographic hash functions
Hash function security summary
Hash_function_security_summary
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
Message-digest hashing algorithm
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 was
MD5
Attack model against cryptographic hash functions
attack on cryptographic hash functions tries to find a message that has a specific hash value. A cryptographic hash function should resist attacks on
Preimage_attack
Random data used as an additional input to a hash function
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 against attacks
Salt_(cryptography)
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)
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
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)
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
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
2015 password-based key derivation function
Argon2 is a key derivation function that was selected as the winner of the 2015 Password Hashing Competition. It was designed by Alex Biryukov, Daniel
Argon2
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
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
Type of parallel processing
Single instruction, multiple data (SIMD) is a type of parallel computing (processing) in Flynn's taxonomy. SIMD describes computers with multiple processing
Single instruction, multiple data
Single_instruction,_multiple_data
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)
Password-based key derivation function
cryptographic key derivation function used for password hashing on Fedora Linux, Debian, Ubuntu, and Arch Linux. The function is more resistant to offline
Yescrypt
Theory of cryptography
cryptographic primitives, including cryptographic hashes, message authentication codes, mask generation functions, stream ciphers, pseudo-random number generators
Sponge_function
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
Set of cryptographic hash functions
SHA-2 (Secure Hash Algorithm 2) is a set of cryptographic hash functions designed by the United States National Security Agency (NSA) and first published
SHA-2
Cryptographic primitive
multi-block-length hash function based on block ciphers" and typically achieves (asymptotic) rates between 1 and 2 independent of the hash size (only with
One-way_compression_function
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)
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)
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 attack
faster than a brute force would be. A hash of n bits can be broken in 2n/2 time steps (evaluations of the hash function). Mathematically stated, a collision
Collision_attack
Cryptographic hash function
family of cryptographic hash functions developed in 1992 (the original RIPEMD) and 1996 (other variants). There are five functions in the family: RIPEMD
RIPEMD
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 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)
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 functions that take a variable-length
Cryptography
Type of cryptographic attack
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 % {\textstyle
Birthday_attack
Cryptographic hash function
Fugue is a cryptographic hash function submitted by IBM to the NIST hash function competition. It was designed by Shai Halevi, William E. Hall, and Charanjit
Fugue_(hash_function)
Cryptographic hash function
The elliptic curve only hash (ECOH) algorithm was submitted as a candidate for SHA-3 in the NIST hash function competition. However, it was rejected in
Elliptic_curve_only_hash
Cryptographic hash function
cryptographic hash function submitted by the France-funded research project Saphir to NIST's international competition on hash functions. The research
Shabal
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)
Information used for message authentication and integrity checking
different hashing primitive (SHA-1 and SHA-2) then XORed together to output the MAC. Universal hashing and in particular pairwise independent hash functions provide
Message_authentication_code
cryptography, cryptographic hash functions can be divided into two main categories. In the first category are those functions whose designs are based on
Security of cryptographic hash functions
Security_of_cryptographic_hash_functions
Cryptographic hash function
provably secure hash functions. It is based on the concept of the fast Fourier transform (FFT). SWIFFT is not the first hash function based on the FFT
SWIFFT
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
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)
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
2009 password-based key derivation function
length in octets of the hash function (32 for SHA256). MFlen: Integer The length in octets of the output of the mixing function (SMix below). Defined as
Scrypt
Type of message authentication code
calculated using universal hashing, which involves choosing a hash function from a class of hash functions according to some secret (random) process and applying
UMAC_(cryptography)
System that regulates the formation of blocks on a blockchain
increasing reliance on specialized hardware, Litecoin changed the Hashcash hash function from SHA-256 to Scrypt. Developed by Colin Percival and detailed in
Proof_of_work
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
Method of building collision-resistant cryptographic hash functions
Merkle–Damgård hash function is a method of building collision-resistant cryptographic hash functions from collision-resistant one-way compression functions. This
Merkle–Damgård_construction
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
Concept in cryptography
cryptographic algorithms, typically block ciphers and cryptographic hash functions, wherein if an input is changed slightly (for example, flipping a single
Avalanche_effect
Message Authenticator Algorithm (MAA) was one of the first cryptographic functions for computing a message authentication code (MAC). It was designed in
Message Authenticator Algorithm
Message_Authenticator_Algorithm
Russian cryptographic hash function
hash function defined in the Russian national standard GOST R 34.11-2012 Information Technology – Cryptographic Information Security – Hash Function.
Streebog
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
Attack against cryptographical hash functions
hashing functions work by taking the input message, and using it to transform an internal state. After all of the input has been processed, the hash digest
Length_extension_attack
Cryptographic hash function
cryptographic hash function with a variable output length. HAS-V is a hash function based on a block cipher. The hash function can produce hash values with
HAS-V
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
Ukrainian cryptographic hash function
cryptographic hash function defined in the Ukrainian national standard DSTU 7564:2014. It was created to replace an obsolete GOST hash function defined in
Kupyna
Cryptography primitive
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 and is not suitable
Panama_(cryptography)
Method of negotiating credentials between web server and browser
information, such as online banking transaction history. It applies a hash function to the username and password before sending them over the network. In
Digest_access_authentication
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 – 128
HAVAL
Revision of the C++ programming language released in 2026
read-copy-update mechanism <simd>: Data-parallel access (Single instruction, multiple data or SIMD) support, and namespace std::simd <text_encoding>: Support
C++26
Cryptographic hash primitive
Second Cryptographic Hash Workshop, held in Santa Barbara, California, on August 24–25, 2006, as part of the NIST hash function competition. The same
RadioGatún
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)
Key derivation function based on an HMAC
underlying extractor hash function, if not provided) and the I K M {\displaystyle \mathrm {IKM} } as the message. The underlying hash function used for HKDF-Extract
HKDF
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
Techniques to protect against brute-force attack
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
cryptographic hash function. MDC-2 is a hash function based on a block cipher with a proof of security in the ideal-cipher model. The length of the output hash depends
MDC-2
Cryptographic hash function
CubeHash is a cryptographic hash function submitted to the NIST hash function competition by Daniel J. Bernstein. CubeHash has a 128 byte state, uses wide
CubeHash
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
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
Cryptographic hash function
Spectral Hash is a cryptographic hash function submitted to the NIST hash function competition by Gokay Saldamlı, Cevahir Demirkıran, Megan Maguire, Carl
Spectral_Hash
Property of cryptographic hash functions
cryptographic hash functions. SHA-256 is a cryptographic hash function that is thought to have this property. Informally, a hash function is puzzle friendly
Puzzle_friendliness
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
Any attack based on information gained from the implementation of a computer system
Other functions BLAKE3 CubeHash ECOH FSB Fugue GOST HAS-160 HAVAL Kupyna LSH Lane MASH-1 MASH-2 MD2 MD4 MD6 MDC-2 N-hash RIPEMD RadioGatún SIMD SM3 SWIFFT
Side-channel_attack
Encryption method
programming interface for an AE implementation provides the following functions: Encryption Input: plaintext, key, and optionally a header (also known
Authenticated_encryption
Computer architecture bit width
photo editing and audio and video processing). MD5 is a hash function producing a 128-bit hash value. Apache Avro uses a 128-bit random number as synchronization
128-bit_computing
cryptographically secure pseudorandom permutation that can be used to construct a hash function or stream cipher by using it in a sponge construction. One stated design
Gimli_(cipher)
Computer checksum algorithm
(like auto-generated label names by typical code generators). List of hash functions "First appearance of Adler-32 (see ChangeLog and adler32.c)". "Revisiting
Adler-32
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
Set of cryptographic algorithms by the NSA
Other functions BLAKE3 CubeHash ECOH FSB Fugue GOST HAS-160 HAVAL Kupyna LSH Lane MASH-1 MASH-2 MD2 MD4 MD6 MDC-2 N-hash RIPEMD RadioGatún SIMD SM3 SWIFFT
Commercial National Security Algorithm Suite
Commercial_National_Security_Algorithm_Suite
European research program in cryptography, 2000-2003
Other functions BLAKE3 CubeHash ECOH FSB Fugue GOST HAS-160 HAVAL Kupyna LSH Lane MASH-1 MASH-2 MD2 MD4 MD6 MDC-2 N-hash RIPEMD RadioGatún SIMD SM3 SWIFFT
NESSIE
Message authentication code algorithm
randomly chosen secret hash function and pseudorandom pad. This is achieved by using keyed hash function H and pseudorandom function F. A tag is generated
VMAC
specific to each hash function) Then perform a series of rounds of a compression function to combine the expanded data into a hash state. For each of
List of x86 cryptographic instructions
List_of_x86_cryptographic_instructions
libgcrypt library. Comparison of supported cryptographic hash functions. Here hash functions are defined as taking an arbitrary length message and producing
Comparison of cryptography libraries
Comparison_of_cryptography_libraries
Overview of computer engineering topics
hold Data compression Modulation order Phase-shift keying Hash function List of hash functions String searching algorithm Avalanche effect Rabin–Karp algorithm
Computer engineering compendium
Computer_engineering_compendium
Cryptographic hash function
HAS-160 is a cryptographic hash function designed for use with the Korean KCDSA digital signature algorithm. It is derived from SHA-1, with assorted changes
HAS-160
Family of stream ciphers
pass authenticated encryption and can operate as collision-resistant hash functions designed by Sean O'Neil, Benjamin Gittins and Howard Landman. VEST cannot
VEST
Key derivative function
password hashing scheme (PHS) that can also function as a key derivation function (KDF). It gained recognition during the Password Hashing Competition
Lyra2
NaSHA is a hash function accepted as a first round SHA-3 candidate for the NIST hash function competition. NaSHA was designed by Smile Markovski and Aleksandra
NaSHA
to benefit from alignment, naturally handled by machines with 4-element SIMD registers. 4×4 matrix A matrix commonly used as a transformation of homogeneous
Glossary_of_computer_graphics
Memory-hard key derivation function
Balloon hashing is a key derivation function presenting proven memory-hard password-hashing and modern design. It was created by Dan Boneh, Henry Corrigan-Gibbs
Balloon_hashing
Mathematical function used in cryptography
output bit), T-functions are now widely used in cryptography to construct block ciphers, stream ciphers, PRNGs and hash functions. T-functions were first
T-function
Network packet distribution with multiple cores
bits of the result provided by a hash function, taking as inputs the header fields of the packets. The hash function input is usually customizable and
Multi-core network packet steering
Multi-core_network_packet_steering
travel, tourism, insurance
SIMD HASH-FUNCTION
SIMD HASH-FUNCTION
SIMD HASH-FUNCTION
SIMD HASH-FUNCTION
SIMD HASH-FUNCTION
SIMD HASH-FUNCTION
SIMD HASH-FUNCTION
SIMD HASH-FUNCTION
SIMD HASH-FUNCTION
travel, tourism, insurance