GMSS

from Wikipedia, the free encyclopedia

GMSS is a digital signature process that was developed in 2007 by Johannes Buchmann , Erik Dahmen, Elena Klintsevich, Katsuyuki Okeya and Camille Vuillaume at the TU Darmstadt . It is based on the Merkle signature and is considered quantum secure (i.e. it resists attacks with quantum computers ).

As with the original Merkle method, with GMSS you can only create a limited number of signatures (e.g. ) with one key . The length of the private key is reduced by several orders of magnitude compared to Merkle, as is the key generation time. GMSS also allows the private key and signature length to be minimized at the expense of the time required or vice versa.

It can be proven that the security of GMSS is based solely on the selected hash function (e.g. SHA-256).

Similar to NTRUSign, which is also quantum- proof, GMSS also takes orders of magnitude longer to generate the key than to generate and verify the signature. Another thing they have in common is the relatively large private key length (under certain circumstances many kB ); With GMSS, however, public keys are just as long as the underlying variance function, i.e. very short.

Individual evidence

  1. ^ Johannes Buchmann, Erik Dahmen, Elena Klintsevich, Katsuyuki Okeya and Camille Vuillaume: Merkle Signatures with Virtually Unlimited Signature Capacity . In: Applied Cryptography and Network Security . Springer, 2007, p. 31-45 , doi : 10.1007 / 978-3-540-72738-5_3 ( psu.edu [PDF]).

Web links