The following Matlab project contains the source code and Matlab examples used for calculates x^p mod n .
This is a function that calculates x^p mod N for large value of x^p when the value is out of range of Matlab. One example of this function is for RSA cyphering and deciphering using prime numbers.

The source code and files included in this project are listed in the project files section, please make sure whether the listed source code meet your needs there.

## Project Files:

File Name | Size |
---|---|

license.txt | 1303 |

powermod.m | 210 |