{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,16]],"date-time":"2024-07-16T01:31:58Z","timestamp":1721093518594},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2010,3,1]],"date-time":"2010-03-01T00:00:00Z","timestamp":1267401600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2010,3]]},"DOI":"10.1007\/s11432-010-0046-4","type":"journal-article","created":{"date-parts":[[2010,3,1]],"date-time":"2010-03-01T06:45:29Z","timestamp":1267425929000},"page":"524-536","source":"Crossref","is-referenced-by-count":11,"title":["Conjugate adjoining problem in braid groups and new design of braid-based signatures"],"prefix":"10.1007","volume":"53","author":[{"given":"LiCheng","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"LiHua","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"ZhenFu","family":"Cao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"YiXian","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"XinXin","family":"Niu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,3,1]]},"reference":[{"key":"46_CR1","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/s00145-001-0018-3","volume":"15","author":"S. S. Magliveras","year":"2002","unstructured":"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\u2013297","journal-title":"J Cryptogr"},{"key":"46_CR2","doi-asserted-by":"crossref","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"P. Shor","year":"1997","unstructured":"Shor P. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J Comput, 1997, 26: 1484\u20131509","journal-title":"SIAM J Comput"},{"key":"46_CR3","unstructured":"Kitaev A. Quantum measurements and the abelian stabilizer problem. Report arXiv:quant-ph\/9511026, 1995"},{"key":"46_CR4","first-page":"317","volume":"3","author":"J. Proos","year":"2003","unstructured":"Proos J, Zalka C. Shor\u2019s discrete logarithm quantum algorithm for elliptic curves. Quant Inf Comput, 2003, 3: 317\u2013344","journal-title":"Quant Inf Comput"},{"key":"46_CR5","first-page":"986","volume":"E87-A","author":"E. Lee","year":"2004","unstructured":"Lee E. Braid groups in cryptography. IEICE Trans Fund Electr, 2004, E87-A: 986\u2013992","journal-title":"IEICE Trans Fund Electr"},{"key":"46_CR6","doi-asserted-by":"crossref","first-page":"287","DOI":"10.4310\/MRL.1999.v6.n3.a3","volume":"6","author":"I. Anshel","year":"1999","unstructured":"Anshel I, Anshel M, Goldfeld D. An algebraic method for public-key cryptography. Math Res Lett, 1999, 6: 287\u2013291","journal-title":"Math Res Lett"},{"key":"46_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1007\/3-540-44598-6_10","volume-title":"Advances in Cryptology-CRYPTO 2000","author":"K. Ko","year":"2000","unstructured":"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\u2013183"},{"key":"46_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/3-540-45353-9_2","volume-title":"Topics in Cryptology-CT-RSA 2001","author":"I. Anshel","year":"2001","unstructured":"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\u201327"},{"key":"46_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1007\/3-540-45682-1_9","volume-title":"Advances in Cryptology-ASIACRYPT 2001","author":"J. Cha","year":"2001","unstructured":"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\u2013156"},{"key":"46_CR10","unstructured":"Ko K, Choi D, Cho M, et al. New signature scheme using conjugacy problem. Cryptology ePrint Archive: Report 2002\/168"},{"key":"46_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"486","DOI":"10.1007\/3-540-44647-8_29","volume-title":"Advances in Cryptology-CRYPTO 2001","author":"E. Lee","year":"2001","unstructured":"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\u2013502"},{"key":"46_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1007\/978-3-540-45146-4_13","volume-title":"Advances in Cryptology-CRYPTO 2003","author":"J. H. Cheon","year":"2003","unstructured":"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\u2013225"},{"key":"46_CR13","unstructured":"Hughes J. The left sss attack on ko-lee-cheon-han-kang-park key agreement scheme in b45. Report, Rump session Crypto 2000, 2000"},{"key":"46_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1007\/3-540-45450-0_15","volume-title":"Proceedings of the 7th Australian Conference on Information Security and Privacy","author":"J. Hughes","year":"2002","unstructured":"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\u2013189"},{"key":"46_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1007\/11535218_6","volume-title":"Advances in Cryptology-CRYPTO 2005","author":"A. Myasnikov","year":"2005","unstructured":"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\u201396"},{"key":"46_CR16","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1090\/conm\/360\/06566","volume-title":"Group Theory, Statistics, and Cryptography, Number 360 in Contemporary Mathematics","author":"P. Dehornoy","year":"2004","unstructured":"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\u201333"},{"key":"46_CR17","doi-asserted-by":"crossref","unstructured":"Dehornoy P. Using shifted conjugacy in braid-based cryptography. Report, arXiv:cs\/0609091, 2006","DOI":"10.1090\/conm\/418\/07946"},{"key":"46_CR18","unstructured":"Cao Z, Dong X, Wang L. New public key cryptosystems using polynomials over noncommutative rings. Cryptology ePrint Archive: Report 2007\/009, 2007. 1\u201335"},{"key":"46_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1007\/978-3-540-68914-0_22","volume-title":"Applied Cryptography and Network Security\u2014ACNS 2008","author":"V. Shpilrain","year":"2008","unstructured":"Shpilrain V, Ushakov A. An authentication scheme based on the twisted conjugacy problem. In: Bellovin S, ed. Applied Cryptography and Network Security\u2014ACNS 2008, Lecture Notes in Computer Science, Vol. 5037. Berlin: Springer-Verlag, 2008. 366\u2013372"},{"key":"46_CR20","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1007\/s10623-007-9123-0","volume":"45","author":"K. Ko","year":"2007","unstructured":"Ko K, Lee J, Thomas T. Towards generating secure keys for braid cryptography. Design Code Cryptogr, 2007, 45: 317\u2013333","journal-title":"Design Code Cryptogr"},{"key":"46_CR21","first-page":"50","volume":"33","author":"Y. Ding","year":"2006","unstructured":"Ding Y, Tian H, Wang Y. An improved signature scheme based on the braid group (in Chinese). J Xidian Univ, 2006, 33: 50\u201361","journal-title":"J Xidian Univ"},{"key":"46_CR22","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1145\/1229285.1266996","volume-title":"Proceedings of the 2nd ACM Symposium on Information, Computer and Communications security (ASIACCS\u201907)","author":"L. Wang","year":"2007","unstructured":"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\u201907). New York: ACM Press, 2007. 295\u2013301"},{"key":"46_CR23","unstructured":"Gonzales-Meneses J. Improving an algorithm to solve the multiple simultaneous conjugacy problems in braid groups. Report arXiv:math\/0212150v1, 2002"},{"key":"46_CR24","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/s00145-002-0120-1","volume":"16","author":"M. Bellare","year":"2003","unstructured":"Bellare M, Namprempre C, Pointcheval D, et al. The one-more-RSA-inversion problems and the security of Chaum\u2019s blind signature scheme. J Cryptol, 2003, 16: 185\u2013215","journal-title":"J Cryptol"},{"key":"46_CR25","series-title":"Lecture Notes in Computer Science","first-page":"366","volume-title":"Progress in Cryptology-IndoCrypt 2007","author":"L. Wang","year":"2007","unstructured":"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\u2013372"},{"key":"46_CR26","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/s10623-005-5382-9","volume":"39","author":"S. Maffre","year":"2006","unstructured":"Maffre S. A weak key test for braid based cryptography. Design Code Cryptogr, 2006, 39: 347\u2013373","journal-title":"Design Code Cryptogr"},{"key":"46_CR27","doi-asserted-by":"crossref","unstructured":"Coppersmith D. Modifications to the number field sieve. J Cryptol, 1993, 169\u2013180","DOI":"10.1007\/BF00198464"},{"key":"46_CR28","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1093\/qmath\/45.4.479","volume":"45","author":"E. Elrifai","year":"1994","unstructured":"Elrifai E, Morton H R. Algorithms for positive braids. Quart J Math Oxford Ser, 1994, 45: 479\u2013497","journal-title":"Quart J Math Oxford Ser"},{"key":"46_CR29","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1016\/S0021-8693(03)00292-8","volume":"266","author":"N. Franco","year":"2003","unstructured":"Franco N, Gonzales-Menses J. Conjugacy problem for braid groups and Garside groups. J Algebra, 2003, 266: 112\u2013132","journal-title":"J Algebra"},{"key":"46_CR30","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1016\/j.jalgebra.2005.02.002","volume":"292","author":"V. Gebhardt","year":"2005","unstructured":"Gebhardt V. A new approach to the conjugacy problem in garside groups. J Algebra, 2005, 292: 282\u2013302","journal-title":"J Algebra"},{"key":"46_CR31","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1090\/conm\/360\/06577","volume":"360","author":"V. Shpilrain","year":"2003","unstructured":"Shpilrain V. Assessing security of some group based cryptosystems. Contempor Math, 2003, 360: 167\u2013177","journal-title":"Contempor Math"},{"key":"46_CR32","unstructured":"Garber D. Braid group cryptography. Report, PRIMA School and Conference of Braids, Singapore, 2007. 1\u201375"},{"key":"46_CR33","unstructured":"Anshel M. Braid group cryptography and quantum cryptoanalysis. In: 8th International Wigner Symposium, Baruch College of CUNY, New York, USA, 2003. 13\u201327"},{"key":"46_CR34","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s00450-006-0008-7","volume":"21","author":"M. Rotteler","year":"2006","unstructured":"Rotteler M. Quantum algorithms: A survey of some recent results. Informatik Forsc Entw, 2006, 21: 3\u201320","journal-title":"Informatik Forsc Entw"},{"key":"46_CR35","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/j.tcs.2007.02.057","volume":"380","author":"P. Koiran","year":"2007","unstructured":"Koiran P, Nesme V, Portier N. The quantum query complexity of the abelian hidden subgroup problem. Theor Comput Sci, 2007, 380: 115\u2013126","journal-title":"Theor Comput Sci"},{"key":"46_CR36","first-page":"1","volume-title":"Proceedings of the Symposium on Theory of Computing","author":"K. Friedl","year":"2003","unstructured":"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\u20139"},{"key":"46_CR37","unstructured":"Bacon D, Childs A M, Dam WV. Optimal measurements for the dihedral hidden subgroup problem. Report arXiv:quantph\/0501044v2, 2005"},{"key":"46_CR38","first-page":"469","volume-title":"Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science","author":"D. Bacon","year":"2005","unstructured":"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\u2013478"},{"key":"46_CR39","unstructured":"Bacon D. How a Clebsch-Gordan transform helps to solve the Heisenberg hidden subgroup problem. Report arXiv:quantph\/0612107v2, 2006"},{"key":"46_CR40","doi-asserted-by":"crossref","unstructured":"Krovi H, Roetteler M. An efficient quantum algorithm for the hidden subgroup problem over Weyl-Heisenberg groups. Report arXiv: quant-ph\/0810.3695, 2008","DOI":"10.1007\/978-3-540-89994-5_7"},{"key":"46_CR41","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1109\/5992.909000","volume":"3","author":"R. Jozsa","year":"2001","unstructured":"Jozsa R. Quantum factoring, discrete logarithms, and the hidden subgroup problem. Comput Sci Eng (CSE), 2001, 3: 34\u201343","journal-title":"Comput Sci Eng (CSE)"},{"key":"46_CR42","unstructured":"Lomonaco S J, Kauffman L H. Quantum hidden subgroup problems: A mathematical perspective. Report arXiv:quantph\/0201095, 2002"},{"key":"46_CR43","unstructured":"Lomont C. The hidden subgroup problem\u2014review and open problems. Report arXiv:quant-ph\/0411037, 2004"},{"key":"46_CR44","unstructured":"Moore C, Russell A, Vazirani U. A classical one-way function to confound quantum adversaries. Report arXiv: quantph\/0701115, 2007"},{"key":"46_CR45","unstructured":"Denney A, Moore C, Russell A. Finding conjugate stabilizer subgroups of PSL(2; q). Report, arXiv: 0809.2445, 2009"},{"key":"46_CR46","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/s00493-004-0009-8","volume":"24","author":"M. Grigni","year":"2004","unstructured":"Grigni M, Schulman L J, Vazirani M, et al. Quantum mechanical algorithms for the nonabelian hidden subgroup problem. Combinatorica, 2004, 24: 137\u2013154","journal-title":"Combinatorica"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-010-0046-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11432-010-0046-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-010-0046-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,30]],"date-time":"2023-05-30T17:30:13Z","timestamp":1685467813000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11432-010-0046-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,3]]},"references-count":46,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,3]]}},"alternative-id":["46"],"URL":"https:\/\/doi.org\/10.1007\/s11432-010-0046-4","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"value":"1674-733X","type":"print"},{"value":"1869-1919","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,3]]}}}