<instructions>Your goal is to analyze the following comment and estimate how highly it will be upvoted by the Hacker News community.</instructions><comment><author>er4hn</author><text>Something else worth noting from the article&lt;p&gt;===&lt;p&gt;If however, you know the number of hops you can use an exponentiation trick to find the ending point quite quickly. For example, and omitting the details of elliptic curve operations: 2P = P dot P and then 4P = 2P dot 2P. This allows you to get up to those crazy high calculations exponentially faster.&lt;p&gt;===&lt;p&gt;One big difficulty in ECC vs RSA is how to do the math required for the operations. With RSA choosing the keys is the part where dragons lie and you need to make sure the numbers chosen satisfy various criteria. The algorithms for working with keys in RSA are well defined. The opposite is true for ECC. It is easier to choose numbers but depending on the curve used as well as how it is implemented there can be information leaked about the key in timings and other behavior.&lt;p&gt;If you want to read more check out the Wikipedia article on the Montgomery Ladder ( &lt;a href=&quot;https:&amp;#x2F;&amp;#x2F;en.wikipedia.org&amp;#x2F;wiki&amp;#x2F;Elliptic_curve_point_multiplication#Point_multiplication&quot; rel=&quot;nofollow&quot;&gt;https:&amp;#x2F;&amp;#x2F;en.wikipedia.org&amp;#x2F;wiki&amp;#x2F;Elliptic_curve_point_multiplic...&lt;/a&gt;) as well as DJB&amp;#x27;s comparison chart of curves that don&amp;#x27;t support the Montgomery Lader: &lt;a href=&quot;https:&amp;#x2F;&amp;#x2F;safecurves.cr.yp.to&amp;#x2F;ladder.html&quot; rel=&quot;nofollow&quot;&gt;https:&amp;#x2F;&amp;#x2F;safecurves.cr.yp.to&amp;#x2F;ladder.html&lt;/a&gt; . The real kicker here is that the NIST P-### curves are what ends up in official US government requirements.. and they are vulnerable to side channel attacks due to their design.</text><parent_chain></parent_chain></comment><story><title>(Very) Basic Intro to Elliptic Curve Cryptography</title><url>https://qvault.io/2020/09/17/very-basic-intro-to-elliptic-curve-cryptography/</url></story>
<instructions>Your goal is to analyze the following comment and estimate how highly it will be upvoted by the Hacker News community.</instructions><comment><author>ragona</author><text>This post leaves out a key difference between something like RSA and EC, which is that EC doesn’t actually provide an encryption function. You end up using an integrated encryption scheme.&lt;p&gt;&lt;a href=&quot;https:&amp;#x2F;&amp;#x2F;en.m.wikipedia.org&amp;#x2F;wiki&amp;#x2F;Integrated_Encryption_Scheme&quot; rel=&quot;nofollow&quot;&gt;https:&amp;#x2F;&amp;#x2F;en.m.wikipedia.org&amp;#x2F;wiki&amp;#x2F;Integrated_Encryption_Scheme&lt;/a&gt;&lt;p&gt;This is intuitively similar to how TLS works, in which asymmetric concepts are used in conjunction with a KDF and hashing algorithm to agree upon a per-session symmetric key.</text><parent_chain></parent_chain></comment><story><title>(Very) Basic Intro to Elliptic Curve Cryptography</title><url>https://qvault.io/2020/09/17/very-basic-intro-to-elliptic-curve-cryptography/</url></story>