Cryptology ePrint Archive: Report 2017/058

WalnutDSA(TM): A Quantum Resistant Group Theoretic Digital Signature Algorithm

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

Abstract: In 2005 I. Anshel, M. Anshel, D. Goldfeld, and S. Lemieux introduced E-Multiplication, a quantum-resistant group-theoretic one-way function which can be used as a basis for many different cryptographic applications. For example, Anshel and Goldfeld recently introduced AEHash, a cryptographic hash function constructed from E-Multiplication and later defined an instance thereof called Hickory Hash.

This paper introduces a new public key method based on E-Multiplication, called WalnutDSA. WalnutDSA provides efficient verification, allowing low-power and constrained devices to more quickly and inexpensively validate digital signatures (e.g. a certificate or authentication). This paper introduces the construction of the digital signature algorithm, analyzes the security of the scheme, and discusses the practical results from an implementation.

Category / Keywords: public-key cryptography / {Algebraic Eraser, Group Theoretic Cryptography, Digital Signature, E-Multiplication, Braids

Date: received 26 Jan 2017

Contact author: datkins at securerf com

Available format(s): PDF | BibTeX Citation

Version: 20170131:151402 (All versions of this report)

Short URL: ia.cr/2017/058

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]