rsa sample.txt

RSA加秘算法,各种函数发生器,非常好用

uses FGInt, FGIntPrimeGeneration, FGIntRSA;

Procedure RSAEncryptAndDecrypt_SignAndVerify;
var	
   n, e, d, dp, dq, p, q, phi, one, two, gcd, temp, nilgint : TFGInt;
   test, signature : String;
   ok : boolean;
begin
 // Enter a random number to generate a prime, i.e.
 // incremental search starting from that number
   Base10StringToFGInt('102336547456161301', p);
   PrimeSearch(p);
   Base256StringToFGInt('AEFAFGhdhsgoi!