Fiat / New / Mathematical / Advances / Sn / SIAM Journal / Kang / Choonsik Park / Frank A. Garside / Bn / /
IndustryTerm
potential solution / normal form algorithm / possible solutions / conjugacy search problem / algorithmic solution / heuristic algorithm / cryptographic applications / polynomial time algorithm / interactive proof systems / presented / symmetric / braid / /
Person
Rainer Steinwandt / Emil Artin / Silvio Micali / Andrew M. Odlyzko / Jung Hee Cheon / Byungheup Jun / John Cannon / Mina Teicher / sung Kang / Jae Woo Han / Anja Groch / Jae Choon Cha / Boaz Tsaban / Patrick Dehornoy / David Garber / Juan Gonz / Sang Jin Lee / Jim Hughes / Markus Grassl / Dennis Hofheinz / Shafi Goldwasser / Uzi Vishne / Ki Hyoung Ko / Charles Rackoff / Shmuel Kaplan / Joan S. Birman / Colin Boyd / Alexander Ushakov / Marc Girault / Atul Chaturvedi / Sunder Lal / Vladimir Shpilrain / Dan Boneh / Lynn Batten / Jennifer Seberry / Volker Gebhardt / /
Position
head / /
Product
Uzi / /
PublishedMedium
SIAM Journal on Computing / Journal of Symbolic Computation / Lecture Notes in Computer Science / Journal of Algebra / /
Technology
heuristic algorithm / polynomial time algorithm / Las Vegas algorithm / secret key / pdf / normal form algorithm / cryptography / public key / http / /
A Practical Attack on the Root Problem in Braid Groups Anja Groch, Dennis Hofheinz, and Rainer Steinwandt Abstract. Using a simple heuristic approach to the root problem in braid groups, we show that cryptographic parame