Description: The basic idea of the RSA digital signatures RSA digital signature security depends on the difficulty of factoring large integers. 1, the parameters and the key generated by first selecting two large primes p and q, the calculated N = PQ the Euler function values (p-1)* (q-1) and then select a random integer e, satisfy the GCD (e, (p-1)* (q-1))) = 1 and calculate d = e ^-1 Mod ((p-1)* (q-1)) the public key (e, N), the private key D p, q is the secret parameters, the need for confidentiality. If do not want to save, calculate e, d can be destroyed. 2, the signature algorithm provided to be signed message m, the signature of the message m S = Sigk (m) = m ^ d mod n 3, when the signature verification of the signature algorithm when receiving the signature (s, m), testing m = s ^ e mod n is set up to determine whether the signature is valid.
To Search:
File list (Check if you may need any files):
RSA数字签名源程序\rsadss.cpp
RSA数字签名源程序
Download