Kayawood, a Key Agreement Protocol

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.

[1]  Dave Bacon,et al.  From optimal measurement to efficient quantum algorithms for the hidden subgroup problem over semidirect product groups , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[2]  Mihir Bellare,et al.  Authenticated Key Exchange Secure against Dictionary Attacks , 2000, EUROCRYPT.

[3]  Boaz Tsaban,et al.  A Practical Cryptanalysis of the Algebraic Eraser , 2016, CRYPTO.

[4]  Alexander Ushakov,et al.  Cryptanalysis of the Anshel-Anshel-Goldfeld-Lemieux Key Agreement Protocol , 2009, Groups Complex. Cryptol..

[5]  Dorian Goldfeld,et al.  Defeating the Kalka--Teicher--Tsaban linear algebra attack on the Algebraic Eraser , 2012, ArXiv.

[6]  Gerhard Rosenberger,et al.  Algebraic Methods in Cryptography , 2006 .

[7]  Dennis Hofheinz,et al.  A Practical Attack on Some Braid Group Based Cryptographic Primitives , 2003, Public Key Cryptography.

[8]  Peter W. Shor,et al.  Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1995, SIAM Rev..

[9]  Gilles Brassard,et al.  Strengths and Weaknesses of Quantum Computing , 1997, SIAM J. Comput..

[10]  D. Garber,et al.  LENGTH-BASED CONJUGACY SEARCH IN THE BRAID GROUP , 2002, math/0209267.

[11]  Kenneth G. Paterson,et al.  Modular Security Proofs for Key Agreement Protocols , 2005, ASIACRYPT.

[12]  Boaz Tsaban,et al.  Short expressions of permutations as products and cryptanalysis of the Algebraic Eraser , 2012, Adv. Appl. Math..

[13]  Lov K. Grover.  A fast quantum mechanical algorithm for database search , 1996, STOC '96.

[14]  Alexander A. Razborov,et al.  The Set of Minimal Braids is co-NP-Complete , 1991, J. Algorithms.

[15]  Dmitry Gavinsky,et al.  Quantum solution to the hidden subgroup problem for poly-near-hamiltonian groups , 2004, Quantum Inf. Comput..

[16]  Derek Atkins,et al.  A class of hash functions based on the algebraic eraser™ , 2016, Groups Complex. Cryptol..

[17]  T. Beth,et al.  Polynomial-Time Solution to the Hidden Subgroup Problem for a Class of non-abelian Groups , 1998, quant-ph/9812070.

[18]  Joan S. Birman,et al.  A new approach to the word and conjugacy problems in the braid groups , 1997 .

[19]  M S Waterman,et al.  Identification of common molecular subsequences. , 1981, Journal of molecular biology.

[20]  A. Myasnikov,et al.  Group-based Cryptography , 2008 .

[21]  Patrick Dehornoy,et al.  A Fast Method for Comparing Braids , 1997 .

[22]  C. Lomont.  THE HIDDEN SUBGROUP PROBLEM - REVIEW AND OPEN PROBLEMS , 2004, quant-ph/0411037.

[23]  Frédéric Magniez,et al.  Hidden translation and orbit coset in quantum computing , 2002, STOC '03.

[24]  An isoperimetric inequality for Artin groups of finite type , 1993 .

[25]  D. Goldfeld,et al.  An algebraic method for public-key cryptography , 1999 .

[26]  Derek Atkins,et al.  Ironwood Meta Key Agreement and Authentication Protocol , 2017, ArXiv.

[27]  Volker Gebhardt.  A New Approach to the Conjugacy Problem in Garside Groups , 2003 .

[28]  J. Birman.  Braids, Links, and Mapping Class Groups. , 1975 .

[29]  Alexei Y. Kitaev,et al.  Quantum measurements and the Abelian Stabilizer Problem , 1995, Electron. Colloquium Comput. Complex..

[30]  Umesh V. Vazirani,et al.  Quantum mechanical algorithms for the nonabelian hidden subgroup problem , 2001, STOC '01.