rsa_func.h

rsa 算法demo

//---------------------------------------------------------------------------

#ifndef rsa_funcH
#define rsa_funcH

#include <Classes.hpp>
//---------------------------------------------------------------------------

int  GetPrimeNum(void);
bool IsPrime(int n);
int Gcd(int phi);
int Euler(int e, int phi);
double Mult(int x, int p, int m);
double dMod(double x, double y);
AnsiString enc(const AnsiString& pt, int e, int n);
AnsiString dec(const AnsiString& et, int d, int n);

#endif