New answers tagged collision-resistance
2
votes
Hash of concatenated values (one public, one private)
Let's assume $A$ sends $h =\text{Hash(pv||key)}$ to $B$ with $pv$ is a public $48$-bit information. The aim of attacker is to access $key$ given $h$. This is postfix construction.
The attackers must ...
- 43k
0
votes
Randomness and authentication on short value outputs (48 bits)
Does this scheme achieve my requirements? Does the truncation of the last 48 bits pose a security risk?
The scheme is broken by a passive adversary who gets a single pair $(t,r)$. Observe that the ...
- 1,237
1
vote
non-reversible additive cryptographic hash algorithm
I'm in hurry now, but I want to share with you some ideas (which if needed I'll detail next days):
concatenation can be seen as $x||y = xk+y$ where $k=2^{|y|}$
so $f(x||y) = f(xk+y)$
if we assume $f$ ...
- 448
1
vote
Accepted
Clarification on nonce collision calculation
I'm afraid that it's a significantly more complex calculation based on the mathematics of the birthday problem. Per the link, if we throw $n$ balls into $d$ buckets then the probability $p(n;d)$ of a ...
- 9,576
Top 50 recent answers are included