Affine braid groups: a better platform than braid groups for cryptology?

详细信息    查看全文

• 作者：Ping Zhu (1) (2)
  Qiaoyan Wen (2)
  
• 关键词：Affine braid group ; Braid group ; Conjugacy problem ; Normal form ; Public key cryptosystem ; Word problem ; 20F36 ; 94A60
• 刊名：Applicable Algebra in Engineering, Communication and Computing
• 出版年：2011
• 出版时间：6 - December 2011
• 年：2011
• 卷：22
• 期：5
• 页码：375-391
• 全文大小：402 KB
• 参考文献：1. Allcock D.: Braid pictures for Artin groups. Trans. Am. Math. Soc. 354(9), 3455鈥?474 (2002) CrossRef
  2. Anshel, I., Anshel, M., Fisher, B., Goldfeld, D.: New key agreement protocols in braid group cryptography. In: Proceedings of 2001 Conference Topics in Cryptology: Crypt. Track RSA. Lect. Notes Comput. Sci. 2020, 13鈥?7 (2001)
  3. Anshel I., Anshel M., Goldfeld D.: An algebraic method for public-key cryptography. Math. Res. Lett. 6, 287鈥?92 (1999)
  4. Baumslag G., Fine B., Xu X.: Cryptosystems using linear groups. Appl. Algebra Eng. Commun. Comput. 17, 205鈥?17 (2006) CrossRef
  5. Bessis D.: The dual braid monoid. Ann. Sci. Ecole Norm. Sup. 36(5), 647鈥?83 (2003)
  6. Bigelow S.: Braid groups are linear. J. Am. Math. Soc. 14, 471鈥?86 (2001) CrossRef
  7. Birman J., Gebhardt V., Gonz谩lez-Meneses J.: Conjugacy in Garside groups I: cyclings, powers, and rigidity. Groups Geom. Dyn. 1, 221鈥?79 (2007) CrossRef
  8. Birman J., Gebhardt V., Gonz谩lez-Meneses J.: Conjugacy in Garside groups III: periodic braids. J. Algebra 316(2), 746鈥?76 (2007) CrossRef
  9. Birman J., Gebhardt V., Gonz谩lez-Meneses J.: Conjugacy in Garside groups II: structure of the ultra summit set. Groups Geom. Dynam. 2(1), 16鈥?1 (2008)
  10. Birman J., Ko K., Lee S.: A new approach to the word and conjugacy problems in the braid groups. Adv. Math. 139(2), 322鈥?53 (1998) CrossRef
  11. Brieskorn E.: Die Fundamentalgruppe des Raumes der regul盲ren Orbits einer endlichen komplexen Spiegelungsgruppe. Invent. Math. 12, 57鈥?1 (1971) CrossRef
  12. Brieskorn E., Saito K.: Artin-gruppen und Coxeter-gruppen. Invent. Math. 17, 245鈥?71 (1972) CrossRef
  13. Budney R.: On the image of the Lawrence-Krammer representation. J. Knot Theory Ramif. 14(6), 1鈥?7 (2005)
  14. Cao, Z.F., Dong, X.L., Wang, L.C.: New public key cryptosystems using polynomials over non-commutative rings. Preprint, p. 35. http://eprint.iacr.org/2007/009 (2007)
  15. Charney R.: Artin groups of finite type are biautomatic. Math. Ann. 292(4), 671鈥?83 (1992) CrossRef
  16. Charney R., Peifer D.: The / K(蟺, 1)-conjecture for the affine braid groups. Comment. Math. Helv. 78(3), 584鈥?00 (2003) CrossRef
  17. Cheon, J., Jun, B.: A Polynomial Time Algorithm for the Braid Diffie-Hellman Conjugacy Problem. In: CRYPTO 2003. Lect Notes Comput. Sci. 2729, 212鈥?25 (2003)
  18. Cohen A.M., Wales D.B.: Linearity of Artin groups of finite type. Israel J. Math. 131, 101鈥?23 (2002) CrossRef
  19. Collins D.: Relations among the squares of the generators of the braid group. Invent. Math. 117(1), 525鈥?29 (1994) CrossRef
  20. Crisp, J.: Injective maps between Artin groups. In: Geometrical Group Theory Down Under, Proceedings of Special Year Geometric Group Theory, pp. 119鈥?37. Canberra, Australia (1996)
  21. Dehornoy P.: A fast method for comparing braids. Adv. Math. 125(2), 200鈥?35 (1997) CrossRef
  22. Dehornoy P.: Braid-based cryptography. Contemp. Math. 360, 5鈥?3 (2004)
  23. Dehornoy, P., Dynnikov, I., Rolfsen, D., Wiest, B.: Ordering Braids. Math. Surv. Monogr. 148, Am. Math. Soc. (2008)
  24. Dehornoy P., Paris L.: Gaussian groups and garside groups, two generalizations of artin groups. Proc. London Math. Soc. 79(3), 569鈥?04 (1999) CrossRef
  25. Deligne P.: Les immeubles des groupes de tresses g茅n茅ralis茅s. Invent. Math. 17, 273鈥?02 (1972) CrossRef
  26. Digne F.: On the linearity of Artin braid groups. J. Algebra 268(1), 39鈥?7 (2003) CrossRef
  27. Digne F.: Pr茅sentations duales des groupes de tresses de type affine 脙. Commun. Math. Helv. 81(1), 23鈥?7 (2006) CrossRef
  28. Dynnikov, I.A.: On a Yang-Baxter mapping and the Dehornoy ordering. Uspekhi Mat. Nauk 57(3), 151鈥?52 (2002) (Russian); English Translation in Russ. Math. Surv. 57(3), 592鈥?94 (2002)
  29. Eick, B., Kahrobaei, D.: Polycyclic Groups: A New Platform for Cryptology? Preprint, p. 7. http://arxiv.org/abs/math/0411077 (2004)
  30. El-Rifai E., Morton H.: Algorithms for positive braids. Quart. J. Math. 45(4), 479鈥?97 (1994) CrossRef
  31. Epstein D.B.A., Paterson M.S., Camon G.W., Holt D.F., Levy S.V., Thurston W.P.: Word Processing in Groups. Jones and Bartlett Publishers, Boston, MA, USA (1992)
  32. Franco N.: Conjugacy problem for subgroups with applications to Artin groups and braid type group. Commun. Algebra 34(11), 4207鈥?215 (2006) CrossRef
  33. Franco N., Gonz谩lez-Meneses J.: Conjugacy problem for braid groups and Garside groups. J. Algebra 266(1), 112鈥?32 (2003) CrossRef
  34. Garber D.: Braid group cryptography. In: Berrick, J., Cohen, F.R., Hanbury, E. (eds.) Braids: Introductory Lectures on Braids, Configurations and Their Applications, pp. 329鈥?03. World Scientific, Singapore (2009) CrossRef
  35. Garber D., Kaplan S., Teicher M., Tsaban B., Vishne U.: Probabilistic solutions of equations in the braid group. Adv. Appl. Math. 35, 323鈥?34 (2005) CrossRef
  36. Garber D., Kaplan S., Teicher M., Tsaban B., Vishne U.: Length-based conjugacy search in the braid group. Contemp. Math. 418, 75鈥?7 (2006)
  37. Garside F.: The braid group and other groups. Quart. J. Math. 20(1), 235鈥?54 (1969) CrossRef
  38. Gebhardt V.: A new approach to the conjugacy problem in Garside groups. J. Algebra 292(1), 282鈥?02 (2005) CrossRef
  39. Gebhardt V., Gonz谩lez-Meneses J.: The cyclic sliding operation in Garside groups. Math. Z. 265(1), 85鈥?14 (2010) CrossRef
  40. Gersten S., Short H.: Rational subgroups of biautomatic groups. Ann. Math. 134(1), 125鈥?58 (1991) CrossRef
  41. Gersten S., Short H.: Small cancellation theory and automatic groups: part II. Invent. Math. 105(1), 641鈥?62 (1991) CrossRef
  42. Hofheinz D., Steinwandt R.: A practical attack on some braid group based cryptographic primitives. Lect. Notes Comput. Sci. 2567, 187鈥?98 (2002) CrossRef
  43. Hughes J.: A linear algebraic attack on the AAFG1 braid group cryptosystem. Lect. Notes Comput. Sci. 2384, 176鈥?89 (2002) CrossRef
  44. Hughes, J., Tannenbaum, A.: Length-based attacks for certain group based encryption rewriting systems. In: S脡curit茅 des Communications sur Internet (SECI02), H么tel El Mechtel. Tunis, Tunisie, pp. 5鈥?2 (2002)
  45. Humphreys J.: Reflection Groups and Coxeter Groups. Cambridge University Press, Cambridge (1990)
  46. Johnson D., Albar M.: The centre of the circular braid group. Math. Japon. 30, 641鈥?45 (1985)
  47. Kalka A.: Representation attacks on the braid Diffie-Hellman public key encryption. Appl. Algebra Eng. Commun. Comput. 17(3), 257鈥?66 (2006) CrossRef
  48. Kapovich I., Myasnikov A., Schupp P., Shpilrain V.: Generic-case complexity, decision problems in group theory, and random walks. J. Algebra 264(2), 665鈥?94 (2003) CrossRef
  49. Kent IV R., Peifer D.: A geometric and algebraic description of annular braid groups. Int. J. Algebra Comput. 12, 85鈥?7 (2002) CrossRef
  50. Ko K., Lee S., Cheon J., Han J., Kang J., Park C.: New public-key cryptosystem using braid groups. CRYPTO 2000, Lect. Notes Comput. Sci. 1880, 166鈥?83 (2000) CrossRef
  51. Krammer D.: Braid groups are linear. Ann. Math. 155(1), 131鈥?56 (2002) CrossRef
  52. Labruere C.: Generalized braid groups and mapping class groups. J. Knot Theory Ramif. 6(5), 715鈥?26 (1997) CrossRef
  53. Lee E., Lee S.: Abelian subgroups of Garside groups. Commun. Algebra 36(3), 1121鈥?139 (2008) CrossRef
  54. McCammond, J.: Dual euclidean Artin groups and the failure of the lattice property. Preprint, p. 40. http://www.math.ucsb.edu/~mccammon/papers/lattice-failure.pdf (2011)
  55. Myasnikov A., Shpilrain V., Ushakov A.: Random subgroups of braid groups: an approach to cryptanalysis of a braid group based cryptographic protocol. Lect. Notes Comput. Sci. 3958, 302鈥?14 (2006) CrossRef
  56. Myasnikov A., Shpilrain V., Ushakov A.: Group-based Cryptography. Birkh盲user Verlag, Springer, Berlin (2008)
  57. Myasnikov, A., Ushakov, A.: Length based attack and braid groups: Cryptanalysis of Anshel-Anshel-Goldfeld key exchange protocol. In: Public Key Cryptography PKC 2007. Lect. Notes Comput. Sci. 4450, 76鈥?8 (2007)
  58. Paris L.: Braid groups and Artin groups. In: Papadopoulus, A. (ed.) Handbook of Teichm眉ller Theory, vol 2, EMS Publishing House, Zurich (2008)
  59. Picantin M.: Explicit presentations for the dual braid monoids. C. R. Acad. Sci. Paris, Ser. I 334, 843鈥?48 (2002)
  60. Ram, A., Ramagge, J.: Affine Hecke algebras, cyclotomic Hecke algebras and Clifford theory. A Tribute to CS Seshadri: A Collection of Articles on Geometry and Representation Theory (2003)
  61. Shpilrain V., Ushakov A.: Thompson鈥檚 group and public key cryptography. Lect. Notes Comput. Sci. 3531, 151鈥?63 (2005) CrossRef
  62. Sibert H., Dehornoy P., Girault M.: Entity authentication schemes using braid word reduction. Discrete Appl. Math. 154(2), 420鈥?36 (2006) CrossRef
  63. Sidelnikov V., Cherepnev M., Yaschenko V.: Systems of open distribution of keys on the basis of noncommutative semigroups. Russ. Acad. Sci. Dokl. Math. 48(2), 384鈥?86 (1994)
  64. Tits J.: Normalisateurs de tores I Groupes de Coxeteretendus. J. Algebra 4(1), 96鈥?16 (1966) CrossRef
  65. Vershik A., Nechaev S., Bikbov R.: Statistical properties of braid groups with application to braid groups and growth of heaps. Commun. Math. Phys. 212, 469鈥?01 (2000) CrossRef
  66. Wagner, N., Magyarik, M.: A public key cryptosystem based on the word problem. In: CRYPTO 1984. Lect. Notes Comput. Sci. 196, 19鈥?6 (1985)
  67. Wang L.C., Wang L.H., Cao Z.F., Yang Y.X., Niu X.X.: Conjugate adjoining problem in braid groups and new design of braid-based signatures. Sci. China Inform. Sci. 53, 524鈥?36 (2010) CrossRef
  68. Zheng, H.: General cycling operations in Garside groups. Preprint, p. 22. http://arxiv.org/abs/math/0605741 (2006)
  
• 作者单位：Ping Zhu (1) (2)
  Qiaoyan Wen (2)
  
  1. School of Science, Beijing University of Posts and Telecommunications, Beijing, 100876, China
  2. State key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing, 100876, China
  
• ISSN：1432-0622

文摘

In recent years, various cryptographic protocols using infinite non-commutative groups, notably braid groups, have been proposed. Both experimental and theoretical evidence collected so far, however, makes it appear likely that braid groups are not a good choice for the platform. In this paper, we thus consider to use affine braid groups, a natural generalization of braid groups, as a platform. Like braid groups, affine braid groups have a very nice geometrical interpretation and have several properties that make them acceptable for cryptographic purposes. On the other hand, there are also essential differences between their structures; for example, unlike braid groups, affine braid groups have no Garside structure, which makes the conjugacy problem in these groups more difficult. We examine the feature that makes affine braid groups useful to cryptography and then conclude that this class of groups could provide a promising alternative platform for group-based cryptography.