International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: A Polynomial Time Algorithm for the Braid Diffie-Hellman Conjugacy Problem

Authors:
Jung Hee Cheon
Byungheup Jun
Download:
DOI: 10.1007/978-3-540-45146-4_13
URL: https://iacr.org/archive/crypto2003/27290212/27290212.pdf
Search ePrint
Search Google
Conference: CRYPTO 2003
BibTeX
@inproceedings{crypto-2003-1145,
  title={A Polynomial Time Algorithm for the Braid Diffie-Hellman Conjugacy Problem},
  booktitle={Advances in Cryptology - CRYPTO 2003, 23rd Annual International Cryptology Conference, Santa Barbara, California, USA, August 17-21, 2003, Proceedings},
  series={Lecture Notes in Computer Science},
  publisher={Springer},
  volume={2729},
  pages={212-225},
  url={https://iacr.org/archive/crypto2003/27290212/27290212.pdf},
  doi={10.1007/978-3-540-45146-4_13},
  author={Jung Hee Cheon and Byungheup Jun},
  year=2003
}