function?[outsig]=RSA_digital_signature（nm）
B=5;
[flagpq]=factors_resolve（nB）?;
if?flag==0
????display（‘n不能分解成兩個(gè)素?cái)?shù)的乘積‘）;
????out=0;sig=0;
else
????phi_n=（p-1）*（q-1）;
????
????e=2;%求e
????while?e??????if?gcd（ephi_n）~=1??
??????????e=e+1;
??????else
??????????break;
??????end
????end
????
????d=1;%求d
?