Time-Locked Cryptography (opens in new tab)

(farlow.dev)

4 pointslispybanana1mo ago1 comments

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.

j / k navigate · click thread line to collapse

Time-Locked Cryptography (opens in new tab)

(farlow.dev)

4 pointslispybanana1mo ago1 comments

1 comments

yepchaos28d ago

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.

j / k navigate · click thread line to collapse