Bottomley: Using Elliptic Curve Cryptography with TPM2
Bottomley: Using Elliptic Curve Cryptography with TPM2
Posted Oct 16, 2017 3:33 UTC (Mon) by Otus (subscriber, #67685)In reply to: Bottomley: Using Elliptic Curve Cryptography with TPM2 by Wol
Parent article: Bottomley: Using Elliptic Curve Cryptography with TPM2
> In order to crack RSA, we need to solve the discrete logarithm problem.
No, the RSA problem is not the same as discrete log. It is linked to integer factorization, but does not necessarily imply that either, so it could be easier.