Nostr'a Katılın
2023-04-07 03:33:37 CEST
in reply to

( -_-) on Nostr: That the discrete logarithm problem is hard. All elliptic curve cryptography assumes ...

That the discrete logarithm problem is hard. All elliptic curve cryptography assumes this without proof.