Paper 2007/149
Towards Generating Secure Keys for Braid Cryptography
Ki Hyoung Ko, Jang Won Lee, and Tony Thomas
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 paper, 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.
Metadata
- Available format(s)
-
PDF
PS
- Category
- Foundations
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- braid groupconjugacy problemsecure key
- Contact author(s)
- knot @ knot kaist ac kr
- History
- 2007-04-25: received
- Short URL
- https://ia.cr/2007/149
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2007/149,
author = {Ki Hyoung Ko and Jang Won Lee and Tony Thomas},
title = {Towards Generating Secure Keys for Braid Cryptography},
howpublished = {Cryptology ePrint Archive, Paper 2007/149},
year = {2007},
note = {\url{https://eprint.iacr.org/2007/149}},
url = {https://eprint.iacr.org/2007/149}
}
