title: computing modular arithmetic of huge numbers in matlab (RSA)
body: <p>I am trying to perform an RSA encryption/decryption using modulo function in matlab.
  The problem is that I cannot do mod(x,y) when x is 50+ integer digits and y is also 50+ integer digits.</p>
  
  <p>Is there a function in matlab that can do mod of huge int prime numbers?</p>
  
  <p>Also is there a way to store really huge numbers in a variable such as:
  x=p^e where p and e are 50+ integers.</p>