4 votes

Method to break a baby Elliptic Curve analog to secp256k1

Solving discrete logarithms in $144$-bit groups is hard Even scaling down to 144-bits is likely beyond current capability. To my knowledge the largest elliptic curve problem tackled with "black ...
Daniel S's user avatar
  • 22.8k
3 votes

On the bit security of elliptic curves

It is explained that the field $\mathbf{F}_{2^{256}}$ has a bit security of $128$ Actually, the reference was to an elliptic curve based on the field $\mathbf{F}_q$ (where $q \approx 2^{256}$) but ...
poncho's user avatar
  • 146k

Only top scored, non community-wiki answers of a minimum length are eligible