Posts Tagged ‘Kayawood’

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…

Read More