MathDB2 problems
- 0 votes0 replies0 views
The MD5 collision-resistance conjecture
A message is an input to a message-digest function, and its MD5 checksum is the 128-bit message digest published in 1992. MD5 collision-resistance conjecture. It is computationally…
- 0 votes0 replies0 views
Probabilistic hardness of solving the keyed hash preimage problem against Shor's algorithm
Probabilistic hardness conjecture. This is a probabilistically hard problem, and Shor’s algorithm cannot be used to speed it up.