New answers tagged

2

Or can it be proven that such a construct is not possible? Kinda. Sort of. As usual in complexity theoretical cryptography. The TL;DR is though that the provable, unconditional existance of such a permutation would imply $P\neq NP$. So in complexity theoretical cryptography one of the main objects studied is the so-called One-Way-Function. That is a ...


Top 50 recent answers are included