Rabin signature algorithm
From Wikipedia, the free encyclopedia
In cryptography, the Rabin signature algorithm is a digital signature protocol invented by Michael Rabin. It is closely related to his encryption algorithm and its security depends on the intractability of integer factorization.
Messages for this system must be a quadratic residue modulo n, and must contain redundancy to block existential forgeries. Because of multiple unique roots, the signature is somewhat more difficult to check than that of some other signature schemes.
 |
This mathematics-related article is a stub. You can help Wikipedia by expanding it. |
