|
Most of the cryptographic protocols use computationally hard problems as a basis
of secure encryption. The first public key cryptographic protocol based on
the word problem in non-commutative groups was proposed by
Wagner and Magyarik in 1985.
Recently, there was increasing interest in non-commutative infinite groups as a potential source of
computational hardness and cryptographic protocols. Several cryptographic protocols have been suggested.
In particular public key cryptosystems based
on the conjected hardness of the conjugacy problem in Braid groups.
- Arithmetica Key Agreement Protocol
- Ko-Lee et.al. Key Agreement Protocol
| 
