Name
Abstract | ||
|---|---|---|
Braid cryptosystem was proposed in CRYPTO 2000 as an alternate public-key cryptosystem. The security of this system is based upon the conjugacy problem in braid groups. Since then, there have been several attempts to break the braid cryptosystem by solving the conjugacy problem in braid groups. In this article, we first survey all the major attacks on the braid cryptosystem and conclude that the attacks were successful because the current ways of random key generation almost always result in weaker instances of the conjugacy problem. We then propose several alternate ways of generating hard instances of the conjugacy problem for use braid cryptography. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1007/s10623-007-9123-0 | IACR Cryptology ePrint Archive |
Keywords | DocType | Volume |
Braid groups,Conjugacy problem,Braid cryptography,94A60,20F36,20F10 | Journal | 45 |
Issue | ISSN | Citations |
3 | 0925-1022 | 13 |
PageRank | References | Authors |
0.82 | 13 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ki Hyoung Ko | 1 | 227 | 20.76 |
| Jang-Won Lee | 2 | 34 | 2.94 |
| Tony Thomas | 3 | 13 | 0.82 |