New Public-Key Cryptosystem Using Braid Groups

By K. Ko, Sangjin Lee, Jung Hee Cheon, Jae-Woo Han, Ju-Sung Kang, Choonsik Park. Annual International Cryptology Conference, 2000

482 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Foundations of Garside Theory (2013, methodology): “Owing to its supposed high complexity, it has been proposed to use the Conjugacy Problem of braids to design cryptographical protocols, see [3], [156], or [74] for a survey.”
Conjugacy problem for braid groups and Garside groups1 (2001, background): “Sometimes one also needs to compute c, for instance, when one tries to attack cryptosystems based on conjugacy in G [2,12].”
Conjugacy in Garside groups I: cyclings, powers and rigidity (2006, unknown): “... a series with the unifying title ‘Conjugacy in Garside groups I, II, III, … They have a common goal: to improve Garside’s algorithm for the CDP/CSP in a Garside group to obtain, in the particular case of the braid group Bn, an algorithm which is polynomial both in n and an appropriate measure kX”