Skip to main content

Questions tagged [hash]

A cryptographic hash algorithm is a function which takes a variable size input and produces a fixed size output. The algorithm makes it difficult to find two inputs with the same output or reconstruct the input from the output.

4 votes
0 answers
92 views

For a standard hash function $H$ like SHA-256, one can choose a secret message $M$, compute and publish $h=H(M)$, then prove knowledge of the preimage $M$ in zero knowledge [that is without disclosing ...
fgrieu's user avatar
  • 151k
1 vote
0 answers
61 views

I am engaged in the translation of encrypted files. I have several files encrypted in the same way. The files consist of two parts: 48 byte header example - ...
Alba's user avatar
  • 11
4 votes
2 answers
128 views

The security strength of Hash based DRBG (Hash_DRBG and HMAC_DRBG) confuses me. Which property of Hash determines the security strength of DRBG? For example, which SHA2 algorithms can be used to ...
Citrus Poon's user avatar
6 votes
2 answers
1k views

I have a chunk of data that I need to round-trip through a service that I don't trust, and I want to make sure the data hasn't been tampered with in-transit. I have limited memory and limited storage, ...
Hounshell's user avatar
  • 163
2 votes
1 answer
174 views

I recently saw a specification of a hash function, which is based on a sponge. The hash function produces a $128$ bit message digest $H(X)$. Let's assume that $S$ is the final state of the absorbing ...
David Krell's user avatar
1 vote
0 answers
60 views

I am performing a cryptographic audit and reconstruction for a secure voting system inspired by Pret-a-voter. I currently have access to deterministic PRF mapping (Layer-1) and modulo/checksum filter (...
Rayan Humane's user avatar
0 votes
1 answer
57 views

Let us consider a stateful hash-based signature scheme (e.g. LMS or XMSS) with an $n$-bit hash function where each signature is composed of $x$ hash chains. Assuming an attacker has knowledge of $y &...
Raoul722's user avatar
  • 3,007
1 vote
1 answer
123 views

As I understand the leftover hash lemma: I pick a hash function $h$ at random from an $2$-universal family of hash functions. I pick a random string $s$, and then $(h(x,s),s)$ is statistically close ...
Sam Jaques's user avatar
  • 1,920

15 30 50 per page
1
2 3 4 5
208