Cryptology ePrint Archive: Report 2017/1162

Kayawood, a Key Agreement Protocol

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

Abstract: Public-key solutions based on number theory, including RSA, ECC, and Diffie-Hellman, are subject to various quantum attacks, which makes such solutions less attractive long term. Certain group theoretic constructs, however, show promise in providing quantum-resistant cryptographic primitives because of the infinite, non-cyclic, non-abelian nature of the underlying mathematics. This paper introduces Kayawood Key Agreement protocol (Kayawood, or Kayawood KAP), a new group-theoretic key agreement protocol, that leverages the known NP-Hard shortest word problem (among others) to provide an Elgamal-style, Diffie-Hellman-like method. This paper also (i) discusses the implementation of and behavioral aspects of Kayawood, (ii) introduces new methods to obfuscate braids using Stochastic Rewriting, and (iii) analyzes and demonstrates Kayawood's security and resistance to known quantum attacks.

Category / Keywords: public-key cryptography / Group Theoretic Cryptography, Diffie--Hellman, Key Agreement, E-Multiplication, Braids

Date: received 29 Nov 2017

Contact author: datkins at securerf com

Available format(s): PDF | BibTeX Citation

Version: 20171130:233744 (All versions of this report)

Short URL: ia.cr/2017/1162

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]