Time-Locked Cryptography(farlow.dev)

https://farlow.dev/2023/05/23/when-you-read-this-ill-be-gone

1 コメント

Interesting post. Normally, modular exponentiation is O(log e) via binary exponentiation. By setting the exponent to 2^t, u can force the operation to be sequential.