You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
The current version of the book cites RSA Labs which talks about relative required key sizes for the RSA problem (solved with GNFS) versus an elliptic curve variant (solved using some unnamed sqrt(n) algorithm). We're using this for DH, even though it's obviously not about DH. There's a footnote clarifying that EC vs classic DH has a similar work factor, but it'd be cool if we had a real citation for this instead of just a handwave.
The text was updated successfully, but these errors were encountered:
The current version of the book cites RSA Labs which talks about relative required key sizes for the RSA problem (solved with GNFS) versus an elliptic curve variant (solved using some unnamed sqrt(n) algorithm). We're using this for DH, even though it's obviously not about DH. There's a footnote clarifying that EC vs classic DH has a similar work factor, but it'd be cool if we had a real citation for this instead of just a handwave.
The text was updated successfully, but these errors were encountered: