Instantiating Treeless Signature Schemes

Patrick Weiden; Andreas Hülsing; Daniel Cabarcas; Johannes Buchmann

Paper 2013/065

Instantiating Treeless Signature Schemes

Patrick Weiden, Andreas Hülsing, Daniel Cabarcas, and Johannes Buchmann

Abstract

We study the efficiency of the treeless signature schemes [Lyu08], [Lyu09], [Lyu12] and evaluate their practical performance. We explain how to implement them, e.g., how to realize discrete Gaussian sampling and how to instantiate the random oracles. Our software implementation as well as extensive experimental results are presented. In particular, we compare the treeless signature schemes with currently used schemes and other post-quantum signature schemes. As the experimental data shows non-competitiveness, a discussion of possible improvements concludes the paper.

Metadata

Available format(s): PDF
Category: Public-key cryptography
Publication info: Published elsewhere. Unknown where it was published
Keywords: Digital Signatures Lattice-Based Cryptography Efficiency Implementation Discrete Gaussians Random Oracles
Contact author(s): pweiden @ cdc informatik tu-darmstadt de
History: 2013-02-12: received
Short URL: https://ia.cr/2013/065
License: CC BY

BibTeX

@misc{cryptoeprint:2013/065,
      author = {Patrick Weiden and Andreas Hülsing and Daniel Cabarcas and Johannes Buchmann},
      title = {Instantiating Treeless Signature Schemes},
      howpublished = {Cryptology {ePrint} Archive, Paper 2013/065},
      year = {2013},
      url = {https://eprint.iacr.org/2013/065}
}