Braid groups in cryptology

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E87-A, Issue 5, 2004, Pages 986-992

  Lee, Eonkyung ^a  

^a Sejong University   (South Korea)

Author keywords

Bit security; Braid group; Conjugacy search problem; Key agreement protocol; Pseudorandom number generator

Indexed keywords

ALGORITHMS; PROBABILITY; PROBLEM SOLVING; PUBLIC KEY CRYPTOGRAPHY; QUANTUM CRYPTOGRAPHY; RANDOM PROCESSES; SEARCH ENGINES; SECURITY OF DATA;

BIT SECURITY; BRAID GROUPS; CONJUGACY SEARCH PROBLEMS (CSP); KEY AGREEMENT PROTOCOLS; PSEUDORANDOM NUMBER GENERATORS;

CRYPTOGRAPHY;

EID: 2642571847     PISSN: 09168508     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Review

References (36)

1. I. Anshel, M. Anshel, B. Fisher, and D. Goldfeld, "New key agreement protocols in braid group cryptography," CT-RSA 2001, LNCS 2020, pp. 13-27, 2001.
2. I. Anshel, M. Anshel, and D. Goldfeld, "An algebraic method for public-key cryptography," Math. Res. Lett., vol.6, pp.287-291, 1999.
3. J. Birman, Braids, links and the mapping class group, Ann. Math. Studies 82, Princeton Univ. Press, 1975.
4. J.S. Birman, K.H. Ko, and S.J. Lee, "A new approaches to the world and conjugacy problem in the braid groups," Adv. Math., vol.139, no.2, pp.322-353, 1998.
5. S.R. Blackburn, "Cryptanalysis of two cryptosystems based on group actions," ASIACRYPT '99, LNCS 1716, pp.52-61, 1999.
6. M. Blum and S. Micali, "How to generate cryptographically strong sequences of pseudorandom bits," SIAM J. Comput., vol.13, pp.850-864, 1984.
7. J.C. Cha, K.H. Ko, S.J. Lee, J.W. Han, and J.H. Cheon, "An efficient implementation of braid groups," ASIACRYPT 2001, LNCS 2248, pp.144-156, 2001.
8. J.H. Cheon and B. Jun, "A polynomial time algorithm for the braid Diffie-Hellman conjugacy problem," CRYPTO 2003, LNCS 2729, pp.212-225, 2003.
9. A. Cleary and J. Dongarra, "Implementation in ScaLAPACK of divide-and-conquer algorithms for banded and tridiagonal linear systems," UT-CS-97-358, April 1997. Available at www.netlib.org/lapack/lawns/downloads/
10. P. Dehornoy, "A fast method for comparing braids," Adv. Math., vol.123, pp.205-235, 1997.
11. W. Diffie and M.E. Hellman, "New directions in cryptography," IEEE Trans. Inf. Theory, vol.22, no.6, pp.644-654, 1976.
12. E.A. Elrifai and H.R. Morton, "Algorithms for positive braids," Quart. J. Math. Oxford Ser.(2), vol.45, no.180, pp.479-497, 1994.
13. D.B.A. Epstein, J.W. Cannon, D.F. Holt, S.V.F. Levy, M.S. Patterson, and W. Thurston, Word processing in groups, Jones and Barlett, Boston and London, 1992.
14. D. Garber, S. Kaplan, M. Teicher, B. Tsaban, and U. Vishne, "Length-based conjugacy search in the braid group," Preprint, Available at www.arxiv.org/math.GR/0209267
15. R. Gennaro and D. Micciancio, "Cryptanalysis of a pseudorandom generator based on braid groups," EUROCRYPT 2002. LNCS 2332, pp.1-13, 2002.
16. J. Gonzaléz-Meneses, "Improving an algorithm to solve multiple simultaneous conjugacy problem in braid groups," Preprint, Available at www.arxiv.org/math.GT/0212150
17. S.G. Hahn, E. Lee, and J.H. Park, "Complexity of the generalized conjugacy problem," Discrete Appl. Math., vol.130, no.1, pp.33-36, 2003.
18. D. Hofheinz and R. Steinwandt, "A practical attack on some braid group based cryptographic primitives," PKC 2003, LNCS 2567, pp.187-198, 2003.
19. J. Hughes, "A linear algebraic attack on the AAFG1 braid group cryptosystem," ACISP 2002, LNCS 2384, pp. 176-189, 2002.
20. J. Hughes and A. Tannenbaum, "Length-based attacks for certain group based encryption rewriting systems," Workshop SECI02 Sécurité de la Communication sur Intenet, Sept. 2002. Available at www.network.com/hughes/SECI02.pdf
21. K.H. Ko, S.J. Lee, J.H. Cheon, J.W. Han, J.S. Kang, and C. Park, "New public-key cryptosystem using braid groups," Crypto 2000, LNCS 1880, pp.166-183, 2000.
22. D. Krammer, "Braid groups are linear," Ann. Math., vol.142, pp.451-486, 2002.
23. S.J. Lee and E. Lee, "Potential weaknesses of the commutator key agreement protocol based on braid groups," EUROCRYPT 2002, LNCS 2332, pp. 14-28, 2002.
24. E. Lee, S.J. Lee, and S.G. Hahn, "Pseudorandomness from braid groups," CRYPTO 2001, LNCS 2139, pp.486-502, 2001.
25. E. Lee and J.H. Park, "Cryptanalysis of the public-key encryption based on braid groups," EUROCRYPT 2003, LNCS 2565, pp.477-490, 2003.
26. S.S. Magliveras, D.R. Stinson, and T. van Trung, "New approaches to designing public key cryptosystems using one-way functions and trapdoors in finite groups," J. Cryptology, vol.15, no.4, pp.285-297, 2002.
27. S.H. Paeng, K.C. Ha, J.H. Kim, S. Chee, and C. Park, "New public key cryptosystem using finite non Abelian groups," CRYPTO 2001, LNCS 2139, pp.470-485, 2001.
28. P.W. Shor, "Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer," SIAM J. Comput., vol.26, pp. 1484-1509, 1997.
29. C. Tobias, "Security analysis of the MOR cryptosystem," PKC 2003, LNCS 2567, pp.175-186, 2003.
30. N.R. Wagner and M.R. Magyarik, "A public-key cryptosystem based on the word problem," CRYPTO '84, LNCS 196, pp.19-36, 1985.
31. V. Wheatman and L. McRory, "Quantum computers: The end of public-key cryptography?," Gartner research note, 2002. Available at www.gartner.com/DisplayDocument?doc_cd=103628
32. P.J. Xu, "The genus of closed 3-braids." J. Knot Theory Ramifications, vol.1, no.3, pp.303-326, 1992.
33. A. Yamamura, "Public-key cryptosystems using the modular group," PKC '98, LNCS 1431, pp.203-216, 1998.
34. A. Yamamura, "A functional cryptosystem using a group action," ACISP '99, LNCS 1587, pp.314-325, 1999.
35. A. Yao, "Theory and applications of trapdoor functions," Proc. 23rd IEEE Symp. of Found. of Comput. Sci., pp.80-91, 1982.
36. Site of braid cryptography papers, crypt.kaist.ac.kr