/*
 *   Program to encrypt a small number.
 *   You have to include Big.cpp and ms32.lib
 *   The program is solving Y = X^e (mod n)
 */

#include <iostream.h>
#include <big.h>   /* include MIRACL system */

Big GCD(Big Num1,Big Num2);

Miracl precision(50000,10); // This makes sure that MIRACL
	// is initialised before main()	// is called
int main()
{ 
	// Encrypting a number
    Big X,Y = 1,e,n;
	cout << "The program will encrypt a small number.\n";
    cout << "It is in the form: Y = X^e (mod n)"<<endl;
	cout << "X as a number = ";
	cin >> X;
	cout << "Input e = ";
	cin >> e;
	cout << "Input n = ";
	cin >> n;

	while (e != 0)  
	{
		Y = (Y * X) % n;
		e --;
	}

	cout<<"Encrypted message is: "<<Y<<endl;
	return 0;
}