Optimal Parameters for XMSS^MT

Andreas Hülsing; Lea Rausch; Johannes Buchmann

Paper 2017/966 Original: eprint.iacr.org/2017/966 ↗

Optimal Parameters for XMSS^MT

Andreas Hülsing

Lea Rausch

Johannes Buchmann

Abstract

We introduce Multi Tree XMSS (XMSS^MT), a hash-based signature scheme that can be used to sign a virtually unlimited number of messages. It is provably forward and hence EU-CMA secure in the standard model and improves key and signature generation times compared to previous schemes. XMSS^MT has --- like all practical hash-based signature schemes --- a lot of parameters that control different trade-offs between security, runtimes and sizes. Using linear optimization, we show how to select provably optimal parameter sets for different use cases.

Metadata

Available format(s): PDF
Category: Public-key cryptography
Publication info: Preprint.
History: 2017-10-03: last updated; 2017-10-03: published
Short URL: https://ia.cr/2017/966
License: https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2017/966,
      author = {Andreas Hülsing and Lea Rausch and Johannes Buchmann},
      title = {Optimal Parameters for XMSS^MT},
      howpublished = {Cryptology {ePrint} Archive, Paper 2017/966},
      year = {2017},
      url = {https://eprint.iacr.org/2017/966}
}