WalnutDSA™: a group theoretic digital signature algorithm. Issue 4 (2nd October 2021)

• Record Type: Journal Article
• Authors: Anshel, Iris; Atkins, Derek; Goldfeld, Dorian; Gunnells, Paul E.
• Is Part Of: International journal of computer mathematics. Volume 6:Issue 4(2021)
• Page Start: 260
• Page End: 284
• Publication Date: 2021-10-02
• Subjects: Group theoretic cryptography -- digital signature -- e-multiplication -- braids -- internet of things -- IoT; Computer systems -- Periodicals; Computer systems; Periodicals; 004
• DOI: 10.1080/23799927.2020.1831613
• Languages: English
• ISSNs: 2379-9927

Abstract

ABSTRACT: This paper presents an in depth discussion of WalnutDSA, a quantum resistant public-key digital signature method based on the one-way function E-multiplication. A key feature of WalnutDSA is that it provides very efficient means of validating digital signatures which is essential for low-powered and constrained devices. This paper presents an in-depth discussion of the construction of the digital signature algorithm, and delves deeply into the underlying mathematics that facilitates analysing the security of the scheme. When implemented using parameters that defeat all known attacks, WalnutDSA is among the fastest quantum resistant signature verification methods; it performs orders of magnitude faster than ECC, even on low-end embedded hardware. WalnutDSA delivers a 12–25× speed improvement over ECDSA on most platforms, and a 31× speed improvement on a 16-bit microcontroller, making it an ideal solution for low-resource processors found in the Internet of Things (IoT).