It is possible to convert a pre-image resistant function $f:\{0,1\}^{n}\rightarrow \{0,1\}^{n}$ to a second-preimage resistant function? I am thinking to use a pseudo-random generator and construct that second pre-image resistant function in this way:


What kind of tests I need to make to verify this function is second-preimage resistant?

  • $\begingroup$ Just let me quickly recap this: $f$ is pre-image resistant and $F$ should be pre-image resistant and second pre-image resistant? $\endgroup$
    – SEJPM
    Jul 26 '15 at 13:01
  • $\begingroup$ @SEJPM Yes it is $\endgroup$
    – juaninf
    Jul 26 '15 at 13:06
  • 1
    $\begingroup$ Related: crypto.stackexchange.com/questions/27071/… $\endgroup$
    – otus
    Jul 26 '15 at 13:30
  • 2
    $\begingroup$ @mikeazo The length preservation indeed makes things a bit trivial. to "convert" just ignore the function and use the identity function instead (or any other permutation for that matter). Since there is only one preimage for each image, there can be no second preimage attack. $\endgroup$
    – Maeher
    Jul 29 '15 at 16:04
  • 1
    $\begingroup$ @Maeher but with the identity function, you don't have preimage resistance. $\endgroup$
    – mikeazo
    Jul 29 '15 at 16:23

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.