title: Python RSA Brute Force Check
body: <p>I have an exercise to brute force a piece of text that has been encrypted with a very small key. The public key I have is (e = 5, n = 203). The text has been converted to ASCII, shifted a fixed number and then encrypted with the RSA public key. I have to decrypt this text using brute force only. To decrypt I'm using the simple formula of:</p>
  
  <pre><code>decrypt = (value**d)%n
  </code></pre>
  
  <p>Where value is the thing I want to decrypt, d being the value I am unsure of and n being the modulus.</p>
  
  <p>So far I have put the numbers in a tuple called en and I loop through it like this: </p>
  
  <pre><code>for i in range(1,10):   
      for a in range(0,41):
         ans = (en[a]**i)%203
         print (chr(ans))
  </code></pre>
  
  <p>The first for loop is "d" the private key value I am not sure of and the second for loop is for going through the 41 length tuple. I don't have the block shift part implemented yet but I want to check if this is the correct way of brute forcing a simple RSA key.</p>