Bottomley: Using Elliptic Curve Cryptography with TPM2
Bottomley: Using Elliptic Curve Cryptography with TPM2
Posted Oct 16, 2017 1:14 UTC (Mon) by rbd (guest, #73313)Parent article: Bottomley: Using Elliptic Curve Cryptography with TPM2
James seems to be a bit confused about what discrete logarithms are. The post says:
In fact, it can be demonstrated mathematically that trying to compute n is equivalent to the discrete logarithm problem….but as the linked Wikipedia article says
Popular choices for the group G in discrete logarithm cryptography are […] cyclic subgroups of elliptic curves over finite fields….so in fact reversing multiplication in the group of an elliptic curve is not just equivalent to the discrete log problem, it is the discrete log problem in a certain class of finite group. As is pointed out in the post, there are elliptic curves where an adversary may have information that makes the discrete log problem unexpectedly easy, but the adversary is still solving the discrete log problem.