title: RSA Algorithm Example
body: <p>In this simplistic example suppose an authority uses a public RSA key (e=11,n=85) to sign
  documents. You wish them to sign your message (which is the number 42) but you don’t want
  them to know what they are signing so you use a blinding factor ”r” of 11.
  In your calculations you may wish to use the following results:</p>
  
  <pre><code>11 ∗ 35 = 1 mod 64
  11 ∗ 31 = 1 mod 85
  </code></pre>
  
  <p>Show brief working.</p>
  
  <p>1) What number should you give the authority to sign?</p>
  
  <p>2) What number will the authority give back to you?</p>
  
  <p>3) Extract the signature for 42 from this number.</p>
  
  <p>4) Verify this answer by using the private key.</p>
  
  <p>I've had a look and if someone could guide this example with me I'd be very appreciated.</p>