GMR (cryptography)
Encyclopedia
In cryptography
, GMR is a digital signature
algorithm
named after its inventors Shafi Goldwasser
, Silvio Micali
and Ron Rivest
.
As with RSA the security of the system is related to the difficulty of factoring very large numbers
. But, in contrast to RSA, GMR is secure against adaptive chosen-message attacks — even when an attacker receives signatures for messages of his choice, this does not allow him to forge a signature for a single additional message.
Cryptography
Cryptography is the practice and study of techniques for secure communication in the presence of third parties...
, GMR is a digital signature
Digital signature
A digital signature or digital signature scheme is a mathematical scheme for demonstrating the authenticity of a digital message or document. A valid digital signature gives a recipient reason to believe that the message was created by a known sender, and that it was not altered in transit...
algorithm
Algorithm
In mathematics and computer science, an algorithm is an effective method expressed as a finite list of well-defined instructions for calculating a function. Algorithms are used for calculation, data processing, and automated reasoning...
named after its inventors Shafi Goldwasser
Shafi Goldwasser
Shafrira Goldwasser is the RSA Professor of electrical engineering and computer science at MIT, and a professor of mathematical sciences at the Weizmann Institute of Science, Israel.-Biography:...
, Silvio Micali
Silvio Micali
Silvio Micali is an Italian-born computer scientist at MIT Computer Science and Artificial Intelligence Laboratory and a professor of computer science in MIT's Department of Electrical Engineering and Computer Science since 1983. His research centers on the theory of cryptography and information...
and Ron Rivest
Ron Rivest
Ronald Linn Rivest is a cryptographer. He is the Andrew and Erna Viterbi Professor of Computer Science at MIT's Department of Electrical Engineering and Computer Science and a member of MIT's Computer Science and Artificial Intelligence Laboratory...
.
As with RSA the security of the system is related to the difficulty of factoring very large numbers
Integer factorization
In number theory, integer factorization or prime factorization is the decomposition of a composite number into smaller non-trivial divisors, which when multiplied together equal the original integer....
. But, in contrast to RSA, GMR is secure against adaptive chosen-message attacks — even when an attacker receives signatures for messages of his choice, this does not allow him to forge a signature for a single additional message.
External links
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks - Shafi Goldwasser, Silvio Micali, Ronald L. Rivest