You are looking at a specific version 20170131:151402 of this paper. See the latest version.

Paper 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.

Metadata
Available format(s)
PDF
Category
Public-key cryptography
Publication info
Preprint. MINOR revision.
Keywords
{Algebraic EraserGroup Theoretic CryptographyDigital SignatureE-MultiplicationBraids
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
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.