Vitalik Buterin: 密码学问题：创建从 [0…2^256 – 1] 到 [0…2^256 – 2] 的可逆的双向函数（或更一般地，-k 表示小 k）其中可逆性的例外在计算上是不可行的。有没有这方面的工作？

Posted on 2022-04-19

原推：Cryptography problem: make an invertible, easy-in-both-directions function from [0…2^256 – 1] to [0…2^256 – 2] (or more generally, -k for small k) where the exceptions to the invertibility are computationally infeasible to find.