GMR (cryptography)

From Wikipedia, the free 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, which is the currently accepted security definition for signature schemes— 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[edit]

  • Goldwasser, Shafi; Micali, Silvio; Rivest, Ronald L. (April 1988). "A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks" (PDF). SIAM Journal on Computing. 17 (2): 281–308. doi:10.1137/0217017. S2CID 1715998. Retrieved 26 October 2022.