WalnutDSA™: a group theoretic digital signature algorithm
Authors:
- 2 November 2020
- journal article
- research article
- Published by Taylor & Francis in International Journal of Computer Mathematics: Computer Systems Theory
- Vol. 6 (4) , 260-284
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).Keywords
This publication has 24 references indexed in Scilit:
- Non-commutative digital signaturesGroups - Complexity - Cryptology, 2012
- Generic quantum Fourier transformsACM Transactions on Algorithms, 2006
- A practical attack on the root problem in braid groups2006
- Length-based conjugacy search in the braid group2006
- Key agreement, the Algebraic Eraser^{𝑇𝑀}, and lightweight cryptography2006
- A new approach to the conjugacy problem in Garside groupsJournal of Algebra, 2005
- The multivariable Alexander polynomial for a closed braid1999
- A New Approach to the Word and Conjugacy Problems in the Braid GroupsAdvances in Mathematics, 1998
- A Fast Method for Comparing BraidsAdvances in Mathematics, 1997
- The set of minimal braids is co-NP-completeJournal of Algorithms, 1991