A polynomial time algorithm for the braid Diffie-Hellman conjugacy problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2729, Issue , 2003, Pages 212-225

  Cheon, Jung Hee ^a   Jun, Byungheup ^b  

^a Seoul National University   (South Korea)

^b Korea Institute for Advanced Study   (South Korea)

Author keywords

Braid group; Conjugacy Problem; Non abelian group

Indexed keywords

ALGORITHMS; CRYPTOGRAPHY; GROUP THEORY; POLYNOMIAL APPROXIMATION;

BIT-OPERATIONS; BRAID GROUPS; CONJUGACY; DIFFIE HELLMAN; ENCRYPTION SCHEMES; KEY EXCHANGE; NON-ABELIAN GROUPS; POLYNOMIAL-TIME ALGORITHMS;

WEAVING;

EID: 33746568769     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45146-4_13     Document Type: Article

References (17)

1. I. Anshel, M. Anshel, B. Fisher, and D. Goldfeld, New Key Agreement Protocols in Braid Group Cryptography, Proc. of CT-RSA 2001, Lecture Notes in Computer Science, Vol. 2020, Springer-Verlag, pp 13-27, 2001.
2. I. Anshel, M. Anshel, and D. Goldfeld, An Algebraic Method for Public-Key Cryptography, Math. Res. Lett., Vol. 6, No. 3-4, pp. 287-291, 1999.
3. J. Birman, K. Ko and S. Lee, A New Approach to the Word and Conjugacy Problem in the Braid Groups, Advances in Mathematics, Vol. 139, pp. 322-353, 1998.
4. J. Cha, K. Koh, S. Lee, J. Han, and J. Cheon, An Efficient Implementations of Braid Groups, Proc. of Asiacrypt 2001, Lecture Notes in Computer Science, Vol. 2248, Springer-Verlag, pp. 144-156, 2001.
5. R. Gennaro and D. Micciancio, Cryptanalysis of a Pseudorandom Generator Based on Braid Groups, Proc. of Eurocrypt 2002, Lecture Notes in Computer Science, Vol. 2332, Springer-Verlag, pp. 1-13, 2002.
6. D. Hofheinz and R. Steinwandt, A Practical Attack on Some Braid Group Based Cryptography Primitives, Proc. of PKC 2003, Lecture Notes in Computer Science, Vol. 2567, Springer-Verlag, pp. 187-198, 2003.
7. G. H. Hardy, E. M. Wright, An introduction to the Theory of Numbers, Oxford Univ. Press, 1978
8. K. Koh et. al New Signature Scheme Using Conjugacy Problem, Preprint, 2002.
9. K. Ko, S. Lee, J. Cheon, J. Han, J. Kang, C. Park, New Pulic-key Cryptosystem using Braid Groups, Proc. of Crypto 2000, Lecture Notes in Computer Science, Vol. 1880, Springer-Verlag, pp. 166-183, 2000
10. 4 is Linear, Inventiones Mathematics, Vol. 142, pp. 451-486, 2002.
11. D. Krammer, Braid groups are Linear, Annals of Mathematics, Vol. 155, pp. 131-156, 2002.
12. S. Lee, The Trapdoor Oneway Functions in Braid Groups, Workshop on Algbraic Methods in Cryptography, Slides are available in http://knot.kaist.ac.kr/ sjlee.
13. S. Lee and E. Lee, Potential Weaknesses of the Commutator Key Agreement Protocol Based on Braid Groups, Proc. of Eurocrypt 2002, Lecture Notes in Computer Science, Vol. 2332, Springer-Verlag, pp. 14-28, 2002.
14. E. Lee and J. Park, Cryptanalysis of the Public-key Encryption based on Braid Groups, Proc. of Eurocrypt 2003, Lecture Notes in Computer Science, Vol. 2656, Springer-Verlag, pp. 477-490, 2003.
15. E. Lee, S. J. Lee and S. G. Hahn, Pseudorandomness from Braid Groups, Proc. of Crypto 2001, Lecture Notes in Computer Science, Vol. 2139, Springer-Verlag, pp. 486-502, 2001.
16. A. Menezes, P. Oorschot, and S. Vanston, Handbook of Applied Cryptography, CRC Press, 1997.
17. G. Strang, Linear Algebra and its Applications, Harcourt, 1986.