Questions tagged [collision-attack]

The tag has no usage guidance.

Filter by
Sorted by
Tagged with
2
votes
1answer
68 views

How would a malicious group of co-signers use a hash collision to sign an unintended message?

According to BIP340: However, a major drawback of this optimization is that finding collisions in a short hash function is easy. This complicates the implementation of secure signing protocols in ...
3
votes
1answer
159 views

Collision finding method

The "birthday paradox" places an upper bound on collision resistance: if a hash function produces $N$ bits of output, an attacker who computes only $2^{N/2}$ (...) hash operations on random ...
0
votes
2answers
164 views

Does google's Shattered paper(The first collision for full SHA-1) mean creating a new file with the same hash as the original file?

I have a source data A and a hash H(A) of this A. Is it possible by google's shattered docs to create a new data B that outputs this H(A)? ++ I understood that the content of the paper is to ...
0
votes
2answers
103 views

Is it possible to get the SHA256 hash collision with partial known data

I have a text sentence that consists of 448 digits [0-9] [a-f] (in HEX format). This text sentence is partially cut off, but I know the middle, and the beginning ...
1
vote
3answers
88 views

Hash function collision importance

Suppose a collision has been found in a certain hash function, such that H(x1) = H(x2) However, x1 and x2 are both a seemingly 'random' collection of bits which do not convey a coherent message, and ...
1
vote
1answer
53 views

Is recursive hashing cyclic?

If I feed the output of H back into H will it cover the entire output space of H before repeating? Consider the following scenario: ...
3
votes
2answers
919 views

How easy is it to fake a file hashed with three functions, CRC32, MD5 and SHA-1?

File-A is hashed with CRC32, MD5 and SHA-1. How easy is it to create a fake file-B that has the same hashes of file-A? CRC32, MD5 and SHA-1? Can an average PC with a GPU calculate a triple hash ...
2
votes
1answer
43 views

Finding $k$ strings $M_i$ such the XOR of the $k$ hashes $H(i,M_i)$ is zero

Let $k\ge2$ be a moderate given constant, and $H:[0,k)\times\{0,1\}^*\to\{0,1\}^b$ be a $b$-bit given hash function assimilated to a random oracle. For example $H(i,M)=\operatorname{SHAKE256}((\...