New Paper: Kayawood Key Agreement Protocol

SecureRF has published a new paper, “Kayawood, a Key Agreement Protocol,” which introduces a 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. The paper also discusses the implementation of and behavioral aspects of Kayawood, introduces new methods to obfuscate braids using Stochastic Rewriting, and analyzes and demonstrates Kayawood’s security and resistance to known quantum attacks. Read the Paper

##

New Paper: Kayawood Key Agreement Protocol