Skip to main content
language, spelling mistakes, formatting
Source Link
Maarten Bodewes
  • 94.5k
  • 13
  • 165
  • 319

The question assumes hat a b bit$b$-bit preimage attack randomly produces b bit preimages. This is not a realistic assumption.

We could imagine a b bit$b$-bit preimage oracle which deterministiclydeterministically produces just a single b bit$b$-bit preimage - never more never less. Running it multiple timeatimes will not give us nothing moreany additional advantage than running it the first time.

Access to a partial preimage oracle does not seem to help at all in solving the full preimage problem.

The question assumes hat a b bit preimage attack randomly produces b bit preimages. This is not a realistic assumption.

We could imagine a b bit preimage oracle which deterministicly produces just a single b bit preimage never more never less. Running it multiple timea will give us nothing more than first time.

Access to a partial preimage oracle does not seem to help at all in solving the full preimage problem.

The question assumes hat a $b$-bit preimage attack randomly produces b bit preimages. This is not a realistic assumption.

We could imagine a $b$-bit preimage oracle which deterministically produces just a single $b$-bit preimage - never more never less. Running it multiple times will not give us any additional advantage than running it the first time.

Access to a partial preimage oracle does not seem to help at all in solving the full preimage problem.

Source Link
Meir Maor
  • 12k
  • 1
  • 23
  • 54

The question assumes hat a b bit preimage attack randomly produces b bit preimages. This is not a realistic assumption.

We could imagine a b bit preimage oracle which deterministicly produces just a single b bit preimage never more never less. Running it multiple timea will give us nothing more than first time.

Access to a partial preimage oracle does not seem to help at all in solving the full preimage problem.