Editing GMR (cryptography)

{{short description|Digital signature algorithm}}
In [[cryptography]], '''GMR''' is a [[digital signature]] [[algorithm]] named after its inventors [[Shafi Goldwasser]], [[Silvio Micali]] and [[Ron Rivest]].

As with [[RSA (algorithm)|RSA]] the security of the system is related to the difficulty of [[Integer factorization|factoring very large numbers]]. But, in contrast to RSA, GMR is secure against ''adaptive [[chosen plaintext attack|chosen-message attack]]s'', which is the currently accepted security definition for signature schemes&mdash; even when an attacker receives signatures for messages of his choice, this does not allow them to forge a signature for a single additional message.

== External links ==
* {{cite journal |last1=Goldwasser |first1=Shafi |last2=Micali |first2=Silvio |last3=Rivest |first3=Ronald L. |title=A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks |journal=SIAM Journal on Computing |date=April 1988 |volume=17 |issue=2 |pages=281–308 |doi=10.1137/0217017 |s2cid=1715998 |url=https://people.csail.mit.edu/rivest/GoldwasserMicaliRivest-ADigitalSignatureSchemeSecureAgainstAdaptiveChosenMessageAttacks.pdf |access-date=26 October 2022}}

{{Cryptography navbox | public-key}}

[[Category:Digital signature schemes]]