title: Can't Interpret Line of Pseudocode (RSA multiplicative inverse)
body: <p>I've been researching how to implement RSA encryption using Extended Euclidean Algorithm to find the private key, d. Every article I read about it directs people to <a href="https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm#Computing_multiplicative_inverses_in_modular_structures" rel="nofollow noreferrer">Wikipedia's website on the topic</a>.</p>
  
  <p>This is great, and super helpful, except for one thing: I can't understand what Wikipedia's pseudocode is saying. </p>
  
  <p>I am having trouble with the line that states:
  <code>(t, newt) := (newt, t - quotient * newt)</code> in the "Modular integers" section. Here's my interpretation:</p>
  
  <pre><code>int tempT = newt;
  newt = t - quotient * newt;
  t = tempT;
  </code></pre>
  
  <p>Is this correct? Thank you for your time!</p>