Skip to main content
SpringerLink
Log in

Conjugate adjoining problem in braid groups and new design of braid-based signatures

  • Research Papers
  • Published:
Science China Information Sciences Aims and scope Submit manuscript

Abstract

The development of quantum computation casts serious threats to the securities of most existing public-key cryptosystems. Braid-based cryptography is one of the alternatives that have potential advantages in resisting quantum attacks. In this paper, the state of the art of braid cryptography is surveyed, and then a new cryptographic problem—conjugate adjoining problem related to braid groups is proposed. Based on this problem, we design a new braid-based signature scheme. This scheme is efficient and provably secure in the random oracle model. Further, we present the comparison between braid-based signatures and RSA-based ones. The signing process of the braid-based schemes is more efficient than that of RSA-based ones, while the verifying process of the braid-based ones is observably slow. Hence, braid-based signatures are suitable for scenarios where the signing process has to be as quick as possible but delays are permitted in the verifying process, for example, in off-line e-cash systems. The key sizes in braid-based schemes are considerably large—about 2K bits in the case of secret keys and 12K bits in the case of public keys. However, braid operations are much simpler and more efficient than modular exponential operations. Therefore, braid-based schemes can be embedded into devices with low computational ability and large memory space. The capability of braid cryptosystems to resist currently known quantum attacks is also discussed from the perspective of hidden subgroup problems.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Magliveras S S, Stinson D R, Trung T V. New approaches to designing public key cryptosystems using one-way functions and trapdoors in finite groups. J Cryptogr, 2002, 15: 285–297

    Article  MATH  Google Scholar 

  2. Shor P. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J Comput, 1997, 26: 1484–1509

    Article  MATH  MathSciNet  Google Scholar 

  3. Kitaev A. Quantum measurements and the abelian stabilizer problem. Report arXiv:quant-ph/9511026, 1995

  4. Proos J, Zalka C. Shor’s discrete logarithm quantum algorithm for elliptic curves. Quant Inf Comput, 2003, 3: 317–344

    MATH  MathSciNet  Google Scholar 

  5. Lee E. Braid groups in cryptography. IEICE Trans Fund Electr, 2004, E87-A: 986–992

    Google Scholar 

  6. Anshel I, Anshel M, Goldfeld D. An algebraic method for public-key cryptography. Math Res Lett, 1999, 6: 287–291

    MATH  MathSciNet  Google Scholar 

  7. Ko K, Lee S, Cheon J, et al. New public-key cryptosystem using braid groups. In: Bellare M, ed. Advances in Cryptology-CRYPTO 2000, Lecture Notes in Computer Science, Vol. 1880. Berlin: Springer-Verlag, 2000. 166–183

    Chapter  Google Scholar 

  8. Anshel I, Anshel M, Fisher B, et al. New key agreement protocols in braid group cryptography. In: Naccache D, ed. Topics in Cryptology-CT-RSA 2001, Lecture Notes in Computer Science, Vol. 2020. Berlin: Springer-Verlag, 2001. 13–27

    Chapter  Google Scholar 

  9. Cha J, Ko K, Lee S, et al. An efficient implementation of braid groups. In: Boyd C, ed. Advances in Cryptology-ASIACRYPT 2001, Lecture Notes in Computer Science, Vol. 2248. Berlin: Springer-Verlag, 2001. 144–156

    Chapter  Google Scholar 

  10. Ko K, Choi D, Cho M, et al. New signature scheme using conjugacy problem. Cryptology ePrint Archive: Report 2002/168

  11. Lee E, Lee S J, Hahn S G. Pseudorandomness from braid groups. In: Kilian J, ed. Advances in Cryptology-CRYPTO 2001, Lecture Notes in Computer Science, Vol. 2139. Berlin: Springer-Verlag, 2001. 486–502

    Chapter  Google Scholar 

  12. Cheon J H, Jun B. A polynomial time algorithm for the braid diffie-hellman conjugacy problem. In: Boneh D, ed. Advances in Cryptology-CRYPTO 2003, Lecture Notes in Computer Science, Vol. 2729. Berlin: Springer-Verlag, 2003. 212–225

    Google Scholar 

  13. Hughes J. The left sss attack on ko-lee-cheon-han-kang-park key agreement scheme in b45. Report, Rump session Crypto 2000, 2000

  14. Hughes J. A linear algebraic attack on the aafg1 braid group cryptosystem. In: Batten L M, Seberry J, eds. Proceedings of the 7th Australian Conference on Information Security and Privacy, Lecture Notes in Computer Science, Vol. 2384. London: Springer-Verlag, 2002. 176–189

    Chapter  Google Scholar 

  15. Myasnikov A, Shpilrain V, Ushakov A. A practical attack on a braid group based cryptographic protocol. In: Shoup V, ed. Advances in Cryptology-CRYPTO 2005, Lecture Notes in Computer Science, Vol. 3621. Berlin: Springer-Verlag, 2005. 86–96

    Google Scholar 

  16. Dehornoy P. Braid-based cryptography. In: Myasnikov A G, ed. Group Theory, Statistics, and Cryptography, Number 360 in Contemporary Mathematics. New York: ACM Press, 2004. 5–33

    Google Scholar 

  17. Dehornoy P. Using shifted conjugacy in braid-based cryptography. Report, arXiv:cs/0609091, 2006

  18. Cao Z, Dong X, Wang L. New public key cryptosystems using polynomials over noncommutative rings. Cryptology ePrint Archive: Report 2007/009, 2007. 1–35

  19. Shpilrain V, Ushakov A. An authentication scheme based on the twisted conjugacy problem. In: Bellovin S, ed. Applied Cryptography and Network Security—ACNS 2008, Lecture Notes in Computer Science, Vol. 5037. Berlin: Springer-Verlag, 2008. 366–372

    Chapter  Google Scholar 

  20. Ko K, Lee J, Thomas T. Towards generating secure keys for braid cryptography. Design Code Cryptogr, 2007, 45: 317–333

    Article  MATH  MathSciNet  Google Scholar 

  21. Ding Y, Tian H, Wang Y. An improved signature scheme based on the braid group (in Chinese). J Xidian Univ, 2006, 33: 50–61

    Google Scholar 

  22. Wang L, Cao Z, Zeng P, et al. One-more matching conjugate problem and security of braid-based signatures. In: Deng R, et al. eds. Proceedings of the 2nd ACM Symposium on Information, Computer and Communications security (ASIACCS’07). New York: ACM Press, 2007. 295–301

    Google Scholar 

  23. Gonzales-Meneses J. Improving an algorithm to solve the multiple simultaneous conjugacy problems in braid groups. Report arXiv:math/0212150v1, 2002

  24. Bellare M, Namprempre C, Pointcheval D, et al. The one-more-RSA-inversion problems and the security of Chaum’s blind signature scheme. J Cryptol, 2003, 16: 185–215

    Article  MATH  MathSciNet  Google Scholar 

  25. Wang L, Cao Z, Zheng S, et al. Transitive signatures from braid groups. In: Srinathan K, et al. eds. Progress in Cryptology-IndoCrypt 2007, Lecture Notes in Computer Science, Vol. 4859. Berlin: Springer-Verlag, 2007. 366–372

    Google Scholar 

  26. Maffre S. A weak key test for braid based cryptography. Design Code Cryptogr, 2006, 39: 347–373

    Article  MATH  MathSciNet  Google Scholar 

  27. Coppersmith D. Modifications to the number field sieve. J Cryptol, 1993, 169–180

  28. Elrifai E, Morton H R. Algorithms for positive braids. Quart J Math Oxford Ser, 1994, 45: 479–497

    Article  MATH  MathSciNet  Google Scholar 

  29. Franco N, Gonzales-Menses J. Conjugacy problem for braid groups and Garside groups. J Algebra, 2003, 266: 112–132

    Article  MATH  MathSciNet  Google Scholar 

  30. Gebhardt V. A new approach to the conjugacy problem in garside groups. J Algebra, 2005, 292: 282–302

    Article  MATH  MathSciNet  Google Scholar 

  31. Shpilrain V. Assessing security of some group based cryptosystems. Contempor Math, 2003, 360: 167–177

    MathSciNet  Google Scholar 

  32. Garber D. Braid group cryptography. Report, PRIMA School and Conference of Braids, Singapore, 2007. 1–75

  33. Anshel M. Braid group cryptography and quantum cryptoanalysis. In: 8th International Wigner Symposium, Baruch College of CUNY, New York, USA, 2003. 13–27

  34. Rotteler M. Quantum algorithms: A survey of some recent results. Informatik Forsc Entw, 2006, 21: 3–20

    Article  Google Scholar 

  35. Koiran P, Nesme V, Portier N. The quantum query complexity of the abelian hidden subgroup problem. Theor Comput Sci, 2007, 380: 115–126

    Article  MATH  MathSciNet  Google Scholar 

  36. Friedl K, Ivanyos G, Magniez F, et al. Hidden translation and orbit coset in quantum computing. In: Proceedings of the Symposium on Theory of Computing. New York: ACM Press, 2003. 1–9

    Google Scholar 

  37. Bacon D, Childs A M, Dam WV. Optimal measurements for the dihedral hidden subgroup problem. Report arXiv:quantph/0501044v2, 2005

  38. Bacon D, Childs A M, Dam W V. From optimal measurement to efficient quantum algorithms for the hidden subgroup problem over semidirect product groups. In: Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science. Washington: IEEE Computer Society. 2005. 469–478

    Chapter  Google Scholar 

  39. Bacon D. How a Clebsch-Gordan transform helps to solve the Heisenberg hidden subgroup problem. Report arXiv:quantph/0612107v2, 2006

  40. Krovi H, Roetteler M. An efficient quantum algorithm for the hidden subgroup problem over Weyl-Heisenberg groups. Report arXiv: quant-ph/0810.3695, 2008

  41. Jozsa R. Quantum factoring, discrete logarithms, and the hidden subgroup problem. Comput Sci Eng (CSE), 2001, 3: 34–43

    Article  Google Scholar 

  42. Lomonaco S J, Kauffman L H. Quantum hidden subgroup problems: A mathematical perspective. Report arXiv:quantph/0201095, 2002

  43. Lomont C. The hidden subgroup problem—review and open problems. Report arXiv:quant-ph/0411037, 2004

  44. Moore C, Russell A, Vazirani U. A classical one-way function to confound quantum adversaries. Report arXiv: quantph/0701115, 2007

  45. Denney A, Moore C, Russell A. Finding conjugate stabilizer subgroups of PSL(2; q). Report, arXiv: 0809.2445, 2009

  46. Grigni M, Schulman L J, Vazirani M, et al. Quantum mechanical algorithms for the nonabelian hidden subgroup problem. Combinatorica, 2004, 24: 137–154

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Information Security Center, State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing, 100876, China

    LiCheng Wang, YiXian Yang & XinXin Niu

  2. National Institute of Information and Communications Technology, Tokyo, 184-8795, Japan

    LiCheng Wang & LiHua Wang

  3. Trusted Digital Technology Laboratory, Shanghai Jiao Tong University, Shanghai, 200240, China

    ZhenFu Cao

Authors
  1. LiCheng Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. LiHua Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. ZhenFu Cao
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. YiXian Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. XinXin Niu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to LiCheng Wang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wang, L., Wang, L., Cao, Z. et al. Conjugate adjoining problem in braid groups and new design of braid-based signatures. Sci. China Inf. Sci. 53, 524–536 (2010). https://doi.org/10.1007/s11432-010-0046-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11432-010-0046-4

Keywords

Search

Navigation