<p><em>This is part one of a series of unknown size; it'll be done when it's done.</em></p>
<p><em>Part one focuses on the basics: ECC, the particular curve, private and public &quot;keys&quot;, and a bonus section on how Monero addresses are generated.</em></p>
<p><em>Note: Monero is based on the <a href="https://cryptonote.org/whitepaper.pdf">Cryptonote protocol</a> -- though it has diverged and will continue to diverge -- along with numerous other coins; much of this series will apply equally well to the others with some caveats. Monero is easily the largest and most active Cryptonote-based project.</em></p>
<p><br /></p>
<p>Hello! I'm an autodidact enthusiast of cryptography, particularly in relation to the crypto-currency <a href="https://getmonero.org" rel="noopener">Monero</a>. Naturally, you should not assume everything I say is correct, and I hope any egregious errors are pointed out so I can fix them (and help my own understanding). Just calling me an idiot is fine too.</p>
<p><img src="http://i.imgur.com/lbp0lz2.jpg" /></p>
<p>Monero's tagline is &quot;Secure, Private, Untraceable.&quot; Secure could refer to a number of facets of a crypto-currency, but here we are only particularly interested in security relating to privacy/anonymity. These articles will be looking at how Monero achieves &quot;privacy&quot;, that is unlinkability and untraceability, with references to security where appropriate. This article focuses on some concepts, which will hopefully make understanding the others easier. Without further ado, let's get into it!</p>
<h3><em>What is Elliptic Curve Cryptography?</em></h3>
<p>Alright, so what is ECC? From <a href="https://en.wikipedia.org/wiki/Elliptic_curve_cryptography" rel="noopener">Wikipedia</a>: &quot; <strong>Elliptic curve cryptography</strong> (<strong>ECC</strong>) is an approach to <a href="https://en.wikipedia.org/wiki/Public-key_cryptography" rel="noopener">public-key cryptography</a> based on the <a href="https://en.wikipedia.org/wiki/Algebraic_structure" rel="noopener">algebraic structure</a> of <a href="https://en.wikipedia.org/wiki/Elliptic_curve" rel="noopener">elliptic curves</a> over <a href="https://en.wikipedia.org/wiki/Finite_field" rel="noopener">finite fields</a>. &quot;</p>
<p>Now, what does that mean? <em>I have no idea.</em></p>
<p>More seriously, let's go through it:</p>
<ol>
  <li>Public-Key Cryptography, or asymmetric cryptography, uses a pair of keys instead of a single private key as in symmetric cryptography (e.g., <a href="https://en.wikipedia.org/wiki/Advanced_Encryption_Standard" rel="noopener">AES</a>): a public key, to be given out to &quot;the world&quot;; and a private key, to be always kept secret. To be secure, it must be <em>hard</em><em> intractable </em>to figure out the private key given the public key; to be usable it must be <em>easy </em>to calculate the public key given the private key. ECC relies on the <a href="https://en.wikipedia.org/wiki/Discrete_logarithm" rel="noopener">ECDLP</a> for its security. <strong>Takeaways: public/private key pair; private-&gt;public is easy, but public-&gt;private is &quot;impossible&quot;.</strong></li>
  <li>&quot;algebraic structure of elliptic curves&quot;: <em>What is this??? </em>It is a plane curve satisfying <img src="http://i.imgur.com/y33UWBP.png" />. It might look something like this:<br />
<img src="https://upload.wikimedia.org/wikipedia/commons/7/76/Elliptic_curve_simple.png" /><br />
<em>Who cares? </em>Right, probably no one. In case someone does, there's a wealth of articles (many related to Bitcoin) out there that explain in detail how they work, how addition is possible, etc. Some examples: <a href="http://www.coindesk.com/math-behind-bitcoin/" rel="noopener">A,</a> <a href="https://blog.cloudflare.com/a-relatively-easy-to-understand-primer-on-elliptic-curve-cryptography/" rel="noopener">B,</a> <a href="http://andrea.corbellini.name/2015/05/17/elliptic-curve-cryptography-a-gentle-introduction/" rel="noopener">C (a series itself)</a>. Numerous videos are out there too, if you're into that. <strong>Takeaways: none, </strong><em><strong>this funny-looking curve will not help you understand and isn't even how Monero's curve looks.</strong></em></li>
  <li>&quot;over finite fields&quot;: this just means curve points are taken modulo some (large, prime) number. Everyone is familiar with modular addition and subtraction at least (even if they've never heard the word) due to our time-keeping. <em>If it is 10am, what time will it be in 5 hours? </em><em><strong>Congrats, you just did modular addition. </strong></em>An elliptic curve over a finite field might look something like this:<br />
<img src="http://i.imgur.com/XXCrdVo.png" /><br />
<em>Whoa, that looks odd. </em>Yes, it does. <strong>Takeaways: none. </strong><em><strong>Actually</strong></em><strong>, note how the points are &quot;reflected&quot; over an invisible line in the center.</strong></li>
</ol>
<p>A primary benefit of using ECC vs something like <a href="https://en.wikipedia.org/wiki/RSA_(cryptosystem)" rel="noopener">RSA</a> is that keys are much smaller for similar security levels.</p>
<p><strong>I believe the only things you need to know to proceed are:</strong></p>
<ol>
  <li>A point on the curve can be added to or subtracted from another point, or itself.</li>
  <li>A point cannot be multiplied or divided by another point.</li>
  <li>Adding a point to itself allows &quot;scalar multiplication&quot;, <strong>which is where the </strong><em><strong>magic</strong></em><strong> happens.</strong></li>
</ol>
<p>Subtracting a point from itself isn't very useful, as it'll just return the ECC equivalent of 0. Division by integer isn't possible (the equivalent modular operation -- modular multiplicative inverse -- is, but only with knowledge of the original scalar).</p>
<p>Scalar multiplication is just adding a point to itself over and over; given a point A, 5A = A + A + A + A + A. Since we use astronomically large scalars to prevent easy brute-forcing, we use techniques like <a href="https://en.wikipedia.org/wiki/Elliptic_curve_point_multiplication#Double-and-add" rel="noopener"><em>double-and-add</em></a><em> </em>to allow computation in near-logarithmic time (i.e., really fast!). A quick example:</p>
<p>Suppose our scalar is 27, and we want to compute 27A. Using the naive method, we'd need 26 additions. Instead:</p>
<ol>
  <li>Add A to itself: 2A. Let's call this new point B.</li>
  <li>Add B to itself: 2B = 4A = C.</li>
  <li>Add C to itself: 2C = 4B = 8A = D.</li>
  <li>Add D to itself: 2D = 4C = 8B = 16A = E.</li>
  <li>Add D to E: 24A = F.</li>
  <li>Add B to F: 26A = G.</li>
  <li>Add A to G: 27A</li>
</ol>
<p>We went from 26 additions to 7. The difference grows exponentially with larger scalars. The speed difference for an average-size scalar is something along the lines of &quot;all the energy in the universe isn't enough&quot; and &quot;takes less than 1/100th of a second on an average computer&quot;, which is interesting to ponder.</p>
<p>That's it for general ECC stuff! If you want more in-depth technical details, please see the links above. :)</p>
<h3><em>The Monero Curve and Private and Public &quot;Keys&quot;</em></h3>
<p>Now, onto the Monero-specific stuff. <em>Finally.</em></p>
<p>First some boring stuff like curve constants. From the <a href="https://cryptonote.org/whitepaper.pdf">Cryptonote whitepaper</a>, we get:</p>
<p><img src="http://i.imgur.com/Sj1yQUj.png" /></p>
<p>We are dealing with the <a href="https://en.wikipedia.org/wiki/EdDSA#Ed25519" rel="noopener">Ed25519</a> curve, which is a <a href="https://en.wikipedia.org/wiki/Twisted_Edwards_curve" rel="noopener">Twisted Edwards Curve</a>. <em>Good, more meaningless details!</em></p>
<p><strong>Let's quickly go through it:</strong></p>
<ul>
  <li><em>q</em>: this is the total number of points on this curve. It is mostly irrelevant for our purposes.</li>
  <li><em>d</em>: an element used in the curve equation below. Not important.</li>
  <li><em>E</em>: the equation for our Ed25519 curve. <em>Wow, shiny! </em>Not important.</li>
  <li><em>G</em>: the base point or generator point. <strong>This is important!</strong> It is the base from which many operations start. It is the &quot;A&quot; in the above example. In hex, which all of our keys are commonly represented in, it looks like: &quot;5866666666666666666666666666666666666666666666666666666666666666&quot;. <em>Great, back to useless information.</em></li>
  <li><em>l</em>: the &quot;order&quot; of the above base point. <strong>This is important</strong>, as it defines the maximum number of points <em>we</em><strong> </strong>can use, and the maximum size our scalars can be. This number is like the number &quot;12&quot; to a clock; adding points or scalars together that would &quot;go over&quot; means they will &quot;wrap around&quot; instead. If you could add <em>G</em> to itself over and over and over until you reached <em>l</em>-1<em> </em>number of additions, you would end up back at <em>G</em>.</li>
  <li><em>Hs </em>and<em> Hp</em>: <em>s </em>means scalar, <em>p </em>means point. These will be discussed in a later article.</li>
</ul>
<p><strong>Note:</strong></p>
<ol>
  <li>Scalars (private keys, really just large integers) are always represented by lowercase letters in equations.</li>
  <li>Points (public keys, really an encoded coordinate on the curve) are always represented by uppercase letters.</li>
</ol>
<p>In the &quot;real world&quot; (user-facing), both private and public keys in Monero are represented by 64 hex characters, similar to the above representation of <em>G</em>. <em>Time for more useless information. </em>Scalars are straightforwardly represented as <a href="https://en.wikipedia.org/wiki/Endianness#Little" rel="noopener">little-endian</a> integers (any integer between 0 and <em>l </em>is valid), while points are specially encoded in a way that is too complex for this article. <em>Or maybe I haven't cared enough about the encoding to research it.</em></p>
<p>If we use <em>x</em> as our private key and <em>P </em>as our public key, then <em>P </em>= <em>xG.</em></p>
<p>Some &quot;fun&quot; examples:</p>
<ol>
  <li><em>x </em>= 1 or &quot;0100000000000000000000000000000000000000000000000000000000000000&quot; (remember little-endian); <em>P </em>= &quot;5866666666666666666666666666666666666666666666666666666666666666&quot; or <em>G. </em>(1<em>G </em>=<em> G</em>)</li>
  <li><em>x </em>= <em>l - 1 or </em>&quot;ecd3f55c1a631258d69cf7a2def9de1400000000000000000000000000000010&quot;; <em>P </em>= &quot;58666666666666666666666666666666666666666666666666666666666666e6&quot; (note similarity to <em>G</em>); This is the last point before wrapping around. You can think of it like <em>-G</em>. Adding G to this value will produce a special identity element, the same as multiplying a point by 0 or order<em> l</em>, or subtracting a point from itself.</li>
  <li>The integer  (<em>l</em>+1)<em> </em>/ 2, &quot;f7e97a2e8d31092c6bce7b51ef7c6f0a00000000000000000000000000000008&quot;, produces the point farthest away from <em>G </em>(close enough, it and the next point are tied due to <em>l </em>being odd), &quot;ac1999070321b2c6309cc8e31aa89a8b3baa75b5f8febf47855555a3e744bcf0&quot;, similar to how 6 is farthest away from 12 on a clock. It (just like <em>G</em> and <strong>every</strong> other point) has a complimentary point (in this case produced by (<em>l</em>-1) / 2), with which it will sum to the identity element.</li>
</ol>
<h3><em>Monero Accounts and Addresses</em></h3>
<p>This has gone a little long, so I'll just briefly restate the information available <a href="https://xmr.llcoins.net/addresstests.html" rel="noopener">here</a> for the standard deterministic derivation. The reason we have two key pairs will be discussed in a future article on stealth addresses.</p>
<ol>
  <li>Choose a random private spend key, typically by creating 256 random bits then &quot;reducing&quot; mod <em>l. </em>Call this key <em>b </em>(to match the whitepaper -- it's confusing I know).</li>
  <li>Hash <em>b </em>with the chosen algorithm, <em>H (</em>Keccak_256 in our usage). Interpret the result as an integer and reduce it mod <em>l </em>as before. Call this key <em>a.</em></li>
  <li>Calculate <em>B </em>= <em>bG </em>and <em>A </em>= <em>aG. </em>These are your public spend and public view keys.</li>
  <li>Hash (prefix (0x12 in standard Monero) + <em>B </em>+ <em>A</em>)<em> </em>with <em>H.</em></li>
  <li>Append the first four bytes of the result to (prefix + <em>B </em>+ <em>A</em>). This will be 69 bytes (1 + 32 + 32 + 4).</li>
  <li>Convert to cnBase58. This is not as straightforward as regular base58, as it uses blocks and padding to result in fixed-length conversions. 69 bytes will always be 95 cnBase58 characters.</li>
</ol>
<p>Integrated addresses (described <a href="http://pastebin.com/bp5RKXuC" rel="noopener">here</a>) are the same as above, but with an 8 byte Payment ID appended to <em>A </em>in step 4 above and a different prefix (0x13).</p>
<p><br /></p>
<p>That does it for the introduction! Hopefully it wasn't completely incoherent rambling. Additional articles on stealth addresses and ring signatures will be coming out sometime soon. <strong>Feedback is appreciated.</strong></p>
<p><img src="http://i.imgur.com/xaYZ6C2.jpg" /></p>
<p>For those of you looking for a TL;DR (or if you're just bored out of your mind), I've included a random picture (but no TL;DR).</p>
<p><img src="http://i.imgur.com/v2RR122.jpg" /></p>
<p>Until next time!</p>