WalnutDSA(TM): A  Quantum-Resistant Digital Signature Algorithm

Iris Anshel; Derek Atkins; Dorian Goldfeld; Paul E Gunnells

Paper 2017/058

WalnutDSA(TM): A Quantum-Resistant Digital Signature Algorithm

Iris Anshel, Derek Atkins, Dorian Goldfeld, and Paul E Gunnells

Abstract

In 2005 I. Anshel, M. Anshel, D. Goldfeld, and S. Lemieux introduced E-Multiplication(TM), a quantum-resistant, group-theoretic, one-way function which can be used as a basis for many different cryptographic applications. This one-way function was specifically designed for constrained devices, running extremely quickly and requiring very little code. This paper introduces WalnutDSA, a new E-Multiplication-based public-key method which provides efficient verification, allowing low-power and constrained devices to quickly and inexpensively validate digital signatures (e.g., a certificate or authentication). It presents an in-depth discussion of the construction of the digital signature algorithm, analyzes the security of the scheme, provides a proof of security under EUF-CMA, and discusses the practical results from implementations on several constrained devices.

Note: The paper has been updated with a security proof and updated analysis and examples.

Metadata

Available format(s): PDF
Publication info: Preprint. MINOR revision.
Keywords: Group Theoretic Cryptography Digital Signature E-Multiplication Braids
Contact author(s): datkins @ securerf com
History: 2017-11-30: last of 2 revisions; 2017-01-31: received; See all versions
Short URL: https://ia.cr/2017/058
License: CC BY

BibTeX

@misc{cryptoeprint:2017/058,
      author = {Iris Anshel and Derek Atkins and Dorian Goldfeld and Paul E Gunnells},
      title = {{WalnutDSA}({TM}): A  Quantum-Resistant Digital Signature Algorithm},
      howpublished = {Cryptology {ePrint} Archive, Paper 2017/058},
      year = {2017},
      url = {https://eprint.iacr.org/2017/058}
}