RSA算法C++实现--密码学实验

#include
#include
#include
#include
#include
using namespace std;

typedef long long LL;

LL p,q,n,n_Euler,e,d;
LL Plaintext[100];//明文
LL Ciphertext[100];//密文
LL Plaintext_C[100];
LL x,y;

LL mul(LL x,LL y){
	return x*y; 
}


bool is_prime(LL x){
	if(x<2)return false;
	for(int i=2;i<=x/i;i++){
		if(x%i==0)return false;
	}
	return true;
} 

 
void prime_create(){ 
	cout<<"---------------prime_create Start---------------------"<>p;
	while(!is_prime(p)){
		cout<<"p不为素数，请重新输入p的值:";
		cin>>p;
	}
	cout<<"请输入q的值:";
	cin>>q;
	while(!is_prime(q)){
		cout<<"q不为素数，请重新输入p的值:";
		cin>>q;
	}
	cout<<"成功输入p和q的值分别为: p:"<