Public key encryption algorithm on braid groups

被引：0
|
作者：
Department of Information Security, School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan 430074, China [1 ]
机构：
[1] Department of Information Security, School of Computer Science and Technology, Huazhong University of Science and Technology
来源：
Ruan Jian Xue Bao | 2007年 / 3卷 / 722-729期
关键词：
Braid group; Burau representation; Conjugate; Multiple variant equation; Public key encryption;
D O I：
10.1360/jos180722
中图分类号：
学科分类号：
摘要：
Braid group is a new considerable public key cryptography platform for the quantum computer ages, but almost all current intractable braid problems used for public key cryptosystems are flawy. The security of a braid public key cryptosystem can't depend only on the hardness of conjugacy problems. By taking advantage of the non-conjugate transformation and multiple variant equations on braid groups, two intractable problems are proposed, and the hardness of these problems comes from the enlarged amount of variants. A new related public key algorithm and the analysis of its correctness, security, efficiency and parameter choice are subsequently presented. The new algorithm can resist current known attacks, and the ideal to combine some simple problems to a multiple variant difficult one is constructive for designing new public key algorithms.
引用
收藏
页码：722 / 729
页数：7
相关论文
共 11 条
  • [1] Shor P.W., Polynomial-Time algorithms for prime factorization and discrete logarithms on a quantum computer, SIAM Journal on Computing, 26, 5, pp. 1484-1509, (1997)
  • [2] Cha J.C., Cheon J.H., Han J.W., Ko K.H., Lee S.J., An efficient implementation of braid groups, Advances in Cryptology-ASIACRYPT 2001, pp. 144-156, (2001)
  • [3] Ko K.H., Lee S.J., Cheon J.H., Han J.W., Kang S.J., Park C.S., New public-key cryptosystem using braid groups, Advances in Cryptology-CRYPTO 2000, pp. 166-183, (2000)
  • [4] Lee E., Park J.H., Cryptanalysis of the public key encryption based on braid groups, Advances in Cryptology-EuroCrypt 2003, pp. 477-490, (2003)
  • [5] Hughes J., A linear algebraic attack on the AAFG1 braid group cryptosystem, Information Security and Privacy-7th Australian Conf., ACISP 2002, pp. 176-189, (2002)
  • [6] Cheon J.H., Jun B., A polynomial time algorithm for the braid Diffie-Hellman conjugacy problem, Advances in Cryptology-CRYPTO 2003, pp. 212-225, (2003)
  • [7] Hofheinz D., Steinwandt R., A practical attack on some braid group based cryptographic primitives, Public Key Cryptography-PKC 2003, pp. 187-198, (2003)
  • [8] Dehornoy P., Braid-based cryptography, Group Theory, Statistics, and Cryptography, Contemporary Mathematics 360, pp. 5-33, (2004)
  • [9] Garber D., Kaplan S., Teicher M., Tsaban B., Vishne U., Probabilistic solutions of equations in the braid group, Advances in Applied Mathematics, 35, 3, pp. 323-334, (2005)
  • [10] Lee S.J., Lee E., Potential weaknesses of the commutator key agreement protocol based on braid groups, EUROCRYPT 2002, pp. 14-28, (2002)
12