SipHash

Hash functions

Texto em inglês

Na Wikipédia

Texto em inglês Ainda não há artigo no seu idioma: trecho em inglês.

SipHash is an add–rotate–xor (ARX) based family of pseudorandom functions created by Jean-Philippe Aumasson and Daniel J. Bernstein in 2012, in response 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 used as a secure message authentication code (MAC). SipHash, however, is not a general purpose key-less hash function such as Secure Hash Algorithms (SHA) and therefore must always be used with a secret key in order to be secure. That is, SHA is designed so that it is difficult for an attacker to find two messages X and Y such that SHA(X) = SHA(Y), even though anyone may compute SHA(X). SipHash instead guarantees that, having seen Xi and SipHash(Xi, k), an attacker who does not know the key k cannot find (any information about) k or SipHash(Y, k) for any message Y ∉ {Xi} which they have not seen before.

Texto: Wikipédia em inglês, CC BY-SA 4.0. ·

Cartas próximas

S

SHA-3

Nº Q1190947 ★★

Sem ofertas
P

Poly1305

Cryptographic message authentication code (MAC) created by Daniel J. Bernstein

Nº Q7226098 ★

Sem ofertas
A

Argon2

Password-based key derivation function

Nº Q21995362 ★★

Sem ofertas
M

MurmurHash

Non-cryptographic hash function

Nº Q4044654 ★★

Sem ofertas
Double Ratchet Algorithm

Cryptographic key management algorithm

Nº Q22079944 ★

Sem ofertas
H

Hashcash

System for dealing with email spam

Nº Q357569 ★★★

Sem ofertas

Carregar mais