Practical Lattice-Based Digital Signature Schemes

James Howe, Thomas Poppelmann, Maire O'Neill, Elizabeth O'Sullivan, Tim Guneysu

Research output: Contribution to journalArticle

24 Citations (Scopus)
1263 Downloads (Pure)

Abstract

Digital signatures are an important primitive for building secure systems and are used in most real-world security protocols. However, almost all popular signature schemes are either based on the factoring assumption (RSA) or the hardness of the discrete logarithm problem (DSA/ECDSA). In the case of classical cryptanalytic advances or progress on the development of quantum computers, the hardness of these closely related problems might be seriously weakened. A potential alternative approach is the construction of signature schemes based on the hardness of certain lattice problems that are assumed to be intractable by quantum computers. Due to significant research advancements in recent years, lattice-based schemes have now become practical and appear to be a very viable alternative to number-theoretic cryptography. In this article, we focus on recent developments and the current state of the art in lattice-based digital signatures and provide a comprehensive survey discussing signature schemes with respect to practicality. Additionally, we discuss future research areas that are essential for the continued development of lattice-based cryptography.
Original languageEnglish
Article number41
Number of pages24
JournalACM Transactions on Embedded Computing Systems
Volume14
Issue number3
DOIs
Publication statusPublished - May 2015

Fingerprint Dive into the research topics of 'Practical Lattice-Based Digital Signature Schemes'. Together they form a unique fingerprint.

  • Cite this