Hacker News new | ask | show | jobs
Time-Locked Cryptography (farlow.dev)
4 points by lispybanana 120 days ago
1 comments

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.