{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T11:43:45Z","timestamp":1776858225280,"version":"3.51.2"},"publisher-location":"Berlin, Heidelberg","reference-count":37,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540679073","type":"print"},{"value":"9783540445982","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44598-6_10","type":"book-chapter","created":{"date-parts":[[2007,5,1]],"date-time":"2007-05-01T10:15:21Z","timestamp":1178014521000},"page":"166-183","source":"Crossref","is-referenced-by-count":170,"title":["New Public-Key Cryptosystem Using Braid Groups"],"prefix":"10.1007","author":[{"given":"Ki Hyoung","family":"Ko","sequence":"first","affiliation":[]},{"given":"Sang Jin","family":"Lee","sequence":"additional","affiliation":[]},{"given":"Jung Hee","family":"Cheon","sequence":"additional","affiliation":[]},{"given":"Jae Woo","family":"Han","sequence":"additional","affiliation":[]},{"given":"Ju-sung","family":"Kang","sequence":"additional","affiliation":[]},{"given":"Choonsik","family":"Park","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2000,8,11]]},"reference":[{"issue":"9","key":"10_CR1","doi-asserted-by":"publisher","first-page":"835","DOI":"10.2307\/2324657","volume":"100","author":"I. Anshel","year":"1993","unstructured":"I. Anshel and M. Anshel, From the Post-Markov theorem through decision problems to public-key cryptography, Amer. Math. Monthly 100 (1993), no. 9, 835\u2013844.","journal-title":"Amer. Math. Monthly"},{"key":"10_CR2","doi-asserted-by":"crossref","first-page":"287","DOI":"10.4310\/MRL.1999.v6.n3.a3","volume":"6","author":"I. Anshel","year":"1999","unstructured":"I. Anshel, M. Anshel and D. Goldfeld, An algebraic method for public-key cryptography Mathematical Research Letters 6 (1999) 287\u2013291.","journal-title":"Mathematical Research Letters"},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"101","DOI":"10.2307\/1969218","volume":"48","author":"E. Artin","year":"1947","unstructured":"E. Artin, Theory of braids, Annals of Math. 48 (1947), 101\u2013126.","journal-title":"Annals of Math"},{"key":"10_CR4","unstructured":"C. H. Bennet and G. Brassard, Quantum cryptography: Public key distribution and coin tossing, Proc. IEEE Int. Conf. Computers, Systems and Signal Processing (Bangalore, India, 1984), 175\u2013179."},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"J. S. Birman, Braids, links and mapping class groups, Annals of Math. Study, no. 82, Princeton University Press (1974).","DOI":"10.1515\/9781400881420"},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1006\/aima.1998.1761","volume":"139","author":"J. S. Birman","year":"1998","unstructured":"J. S. Birman, K. H. Ko and S. J. Lee, A new approach to the word and conjugacy problems in the braid groups, Advances in Math. 139 (1998), 322\u2013353.","journal-title":"Advances in Math."},{"key":"10_CR7","first-page":"203","volume":"46","author":"D. Boneh","year":"1999","unstructured":"D. Boneh, Twenty years of attacks on the RSA cryptosystem, Notices Amer. Math. Soc. 46 (1999), 203\u2013213.","journal-title":"Notices Amer. Math. Soc."},{"key":"10_CR8","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1109\/TIT.1979.1056010","volume":"25","author":"G. Brassard","year":"1979","unstructured":"G. Brassard, A note on the complexity of cryptography, IEEE Transactions on Information Theory 25 (1979), 232\u2013233.","journal-title":"IEEE Transactions on Information Theory"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"E. F. Brickell, Breaking iterated knapsacks, Advances in Cryptology, Proceedings of Crypto\u2019 84, Lecture Notes in Computer Science 196, ed. G. R. Blakley and D. Chaum, Springer-Verlag (1985), 342\u2013358.","DOI":"10.1007\/3-540-39568-7_27"},{"key":"10_CR10","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1006\/aima.1997.1605","volume":"125","author":"P. Dehornoy","year":"1997","unstructured":"P. Dehornoy, A fast method for comparing braids, Advances in Math. 125 (1997), 200\u2013235.","journal-title":"Advances in Math."},{"key":"10_CR11","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W. Diffie","year":"1976","unstructured":"W. Diffie and M. E. Hellman, New directions in cryptography, IEEE Transactions on Informaton Theory 22 (1976), 644\u2013654.","journal-title":"IEEE Transactions on Informaton Theory"},{"key":"10_CR12","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"31","author":"T. ElGamal","year":"1985","unstructured":"T. ElGamal, A public key cryptosystem and a signature scheme based on discrete logarithms, IEEE Transactions on Information Theory 31 (1985), 469\u2013472.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"10_CR13","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1093\/qmath\/45.4.479","volume":"45","author":"E. A. Elrifai","year":"1994","unstructured":"E. A. Elrifai and H. R. Morton, Algorithms for positive braids, Quart. J. Math. Oxford 45 (1994), no. 2, 479\u2013497.","journal-title":"Quart. J. Math."},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"D. Epstein, J. Cannon, D. Holt, S. Levy, M. Paterson and W. Thurston, Word processing in groups, Jones & Bartlett, 1992.","DOI":"10.1201\/9781439865699"},{"issue":"1\u20132","key":"10_CR15","first-page":"75","volume":"42","author":"R. Fenn","year":"1996","unstructured":"R. Fenn, D. Rolfsen and J. Zhu Centralisers in the braid group and singular braid monoid, Enseign. Math. (2) 42 (1996), no. 1\u20132, 75\u201396.","journal-title":"Enseign. Math. (2)"},{"issue":"78","key":"10_CR16","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1093\/qmath\/20.1.235","volume":"20","author":"F. A. Garside","year":"1969","unstructured":"F. A. Garside, The braid group and other groups, Quart. J. Math. Oxford 20 (1969), no. 78, 235\u2013254.","journal-title":"Quart. J. Math."},{"key":"10_CR17","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0304-3975(91)90074-C","volume":"88","author":"M. Garzon","year":"1991","unstructured":"M. Garzon and Y. Zalcstein, The complexity of Grigorchuk groups with application to cryptography, Theoretical Computer Sciences 88 (1991) 83\u201398.","journal-title":"Theoretical Computer Sciences"},{"key":"10_CR18","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/BFb0052231","volume-title":"Advances in Cryptology, Proceedings of Crypto\u2019 97","author":"O. Goldreich","year":"1997","unstructured":"O. Goldreich, S. Goldwasser and S. Halevi, Public-key cryptosystems from lattice reduction problems, Advances in Cryptology, Proceedings of Crypto\u2019 97, Lecture Notes in Computer Science 1294, ed. B. Kaliski, Springer-Verlag (1997), 112\u2013131."},{"key":"10_CR19","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0166-8641(96)00148-4","volume":"78","author":"E. S. Kang","year":"1997","unstructured":"E. S. Kang, K. H. Ko and S. J. Lee, Band-generator presentation for the 4-braid group, Topology Appl. 78 (1997), 39\u201360.","journal-title":"Topology Appl."},{"key":"10_CR20","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1007\/3-540-46766-1_20","volume-title":"Advances in Cryptology, Proceedings of Crypto\u2019 91","author":"K. Komaya","year":"1992","unstructured":"K. Komaya, U. Maurer, T. Okamoto and S. Vanston, New public-key schemes bases on elliptic curves over the ring Z n , Advances in Cryptology, Proceedings of Crypto\u2019 91, Lecture Notes in Computer Science 576, ed. J. Feigenbaum, Springer-Verlag (1992), 252\u2013266"},{"key":"10_CR21","volume-title":"Algorithms and Computations in Mathematics","author":"N. Koblitz","year":"1998","unstructured":"N. Koblitz, Algebraic aspects of cryptography, Algorithms and Computations in Mathematics 3 (1998) Springer-Verlag, Berlin."},{"key":"10_CR22","doi-asserted-by":"crossref","unstructured":"J. C. Lagarias, Knapsack public key cryptosystems and Diophantine approximation, Advances in Cryptology: Proceedings of Crypto\u2019 83, ed. by D. Chaum, Plenum Publishing (1984), 3\u201324.","DOI":"10.1007\/978-1-4684-4730-9_1"},{"key":"10_CR23","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/BF02351718","volume":"1","author":"K. McCurley","year":"1988","unstructured":"K. McCurley, A key distribution system equivalent to factoring, Journal of Cryptology 1 (1988), 95\u2013105.","journal-title":"Journal of Cryptology"},{"key":"10_CR24","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1109\/TIT.1978.1055927","volume":"24","author":"R. C. Merkle","year":"1978","unstructured":"R. C. Merkle and M. E. Hellman, Hiding information and signatures in trapdoor knapsacks, IEEE Transactions on Information Theory 24 (1978), 525\u2013530.","journal-title":"IEEE Transactions on Information Theory"},{"key":"10_CR25","doi-asserted-by":"publisher","first-page":"303","DOI":"10.2307\/2118637","volume":"142","author":"L. Mosher","year":"1995","unstructured":"L. Mosher, Mapping class groups are automatic, Ann. Math. 142 (1995), 303\u2013384.","journal-title":"Ann. Math."},{"key":"10_CR26","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1090\/psapm\/042\/1095552","volume":"42","author":"A. M. Odlyzko","year":"1990","unstructured":"A. M. Odlyzko, The rise and fall of knapsack cryptosystems, Cryptology and Computational Number Theory, Proc. Symp. App. Math. 42 (1990), 75\u201388.","journal-title":"Cryptology and Computational Number Theory, Proc. Symp. App. Math."},{"key":"10_CR27","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/0196-6774(91)90011-M","volume":"12","author":"M. S. Paterson","year":"1991","unstructured":"M. S. Paterson and A. A. Rasborov, The set of minimal braids is co-NP-complete, J. Algorithms. 12 (1991), 393\u2013408.","journal-title":"J. Algorithms."},{"key":"10_CR28","unstructured":"M. O. Rabin, Digitized signatures and public-key functions as intractible as factorization, MIT Laboratory for Computer Science Technical Report, LCS\/TR-212 (1979)."},{"key":"10_CR29","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R. L. Rivest","year":"1978","unstructured":"R. L. Rivest, A. Shamir and L. Adleman, A method for obtaining digital signatures and public key cryptosystems, Communications of the ACM 21 (1978), 120\u2013126.","journal-title":"Communications of the ACM"},{"key":"10_CR30","doi-asserted-by":"crossref","unstructured":"A. Shamir, A polynomial time algorithm for breaking the basis Merkle-Hellman cryptosystem, Advances in Cryptology: Proceedings of Crypto\u2019 82, ed. by D. Chaum et al., Plenum Publishing (1983), 279\u2013288.","DOI":"10.1007\/978-1-4757-0602-4_27"},{"key":"10_CR31","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/0020-0190(90)90170-3","volume":"35","author":"R. Siromoney","year":"1990","unstructured":"R. Siromoney and L. Mathew, A public key cryptosystem based on Lyndon words, Information Proceeding Letters 35 (1990) 33\u201336.","journal-title":"Information Proceeding Letters"},{"key":"10_CR32","unstructured":"P. Smith and M. Lennon, LUC: A new public key system, Proceedings of the IFIP TC11 Ninth International Conference on Information Security, ed. E. Dougall, IFIP\/Sec 93, 103\u2013117, North-Holland, 1993."},{"key":"10_CR33","doi-asserted-by":"crossref","unstructured":"R. P. Stanley, Enumerative combinatorics, Wadsworth and Brooks\/Cole, 1986.","DOI":"10.1007\/978-1-4615-9763-6"},{"key":"10_CR34","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/BFb0054019","volume-title":"PKC\u2019 98","author":"Y. Tsiounis","year":"1998","unstructured":"Y. Tsiounis and M. Yung, On the security of Elgamal based encryption, In PKC\u2019 98, Lecture Notes in Computer Science 1431, Springer-Verlag (1998), 117\u2013134."},{"key":"10_CR35","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/BFb0055732","volume-title":"Advances in Cryptology: Proceedings of Crypto\u2019 98","author":"S. Vaudenay","year":"1998","unstructured":"S. Vaudenay, Cryptanalysis of the Chor-Rivest Cryptosystem, Advances in Cryptology: Proceedings of Crypto\u2019 98, Lecture Notes in Computer Science 1462, ed. Krawczyk, Springer-Verlag (1998), 243\u2013256."},{"key":"10_CR36","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1007\/3-540-39568-7_7","volume-title":"Advances in Cryptology, Proceedings of Crypto\u2019 84","author":"H. Williams","year":"1985","unstructured":"H. Williams, Some public-key crypto-funtions as intractible as factorization, Advances in Cryptology, Proceedings of Crypto\u2019 84, Lecture Notes in Computer Science 196, ed. G. R. Blakley and D. Chaum, Springer-Verlag (1985), 66\u201370."},{"key":"10_CR37","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/3-540-39568-7_3","volume-title":"Advances in Cryptology, Proceedings of Crypto\u2019 84","author":"N. R. Wagner","year":"1985","unstructured":"N. R. Wagner and M. R. Magyarik, A public-key cryptosystem based on the word problem, Advances in Cryptology, Proceedings of Crypto\u2019 84, Lecture Notes in Computer Science 196, ed. G. R. Blakley and D. Chaum, Springer-Verlag (1985), 19\u201336."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44598-6_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T16:34:13Z","timestamp":1556382853000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44598-6_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540679073","9783540445982"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/3-540-44598-6_10","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2000]]}}}