{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T04:21:17Z","timestamp":1769314877078,"version":"3.49.0"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319968834","type":"print"},{"value":"9783319968841","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-96884-1_9","type":"book-chapter","created":{"date-parts":[[2018,7,24]],"date-time":"2018-07-24T10:33:49Z","timestamp":1532428429000},"page":"255-274","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Cryptanalysis via Algebraic Spans"],"prefix":"10.1007","author":[{"given":"Adi","family":"Ben-Zvi","sequence":"first","affiliation":[]},{"given":"Arkadius","family":"Kalka","sequence":"additional","affiliation":[]},{"given":"Boaz","family":"Tsaban","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,7,25]]},"reference":[{"key":"9_CR1","unstructured":"Andrecut, M.: A matrix public key cryptosystem, arXiv eprint 1506.00277 (2015)"},{"key":"9_CR2","doi-asserted-by":"publisher","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. 6, 287\u2013291 (1999)","journal-title":"Math. Res. Lett."},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/978-3-662-53018-4_7","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"A Ben-Zvi","year":"2016","unstructured":"Ben-Zvi, A., Blackburn, S.R., Tsaban, B.: A practical cryptanalysis of the algebraic eraser. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9814, pp. 179\u2013189. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53018-4_7"},{"key":"9_CR4","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1090\/S0894-0347-00-00361-1","volume":"14","author":"S Bigelow","year":"2001","unstructured":"Bigelow, S.: Braid groups are linear. J. Am. Math. Soc. 14, 471\u2013486 (2001)","journal-title":"J. Am. Math. Soc."},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1515\/jmc.2011.003","volume":"4","author":"C Mullan","year":"2011","unstructured":"Mullan, C.: Cryptanalysing variants of Stickel\u2019s key agreement scheme. J. Math. Cryptol. 4, 365\u2013373 (2011)","journal-title":"J. Math. Cryptol."},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1006\/jsco.1996.0125","volume":"24","author":"W Bosma","year":"1997","unstructured":"Bosma, W., Cannon, J., Playoust, C.: The Magma algebra system. I. The user language. J. Symb. Comput. 24, 235\u2013265 (1997)","journal-title":"J. Symb. Comput."},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/3-540-45682-1_9","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2001","author":"JC Cha","year":"2001","unstructured":"Cha, J.C., Ko, K.H., Lee, S.J., Han, J.W., Cheon, J.H.: An efficient implementation of braid groups. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 144\u2013156. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45682-1_9"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/978-3-540-45146-4_13","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"JH Cheon","year":"2003","unstructured":"Cheon, J.H., Jun, B.: A polynomial time algorithm for the braid Diffie-Hellman conjugacy problem. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 212\u2013225. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45146-4_13"},{"key":"9_CR9","unstructured":"Gilman, R., Myasnikov, A., Myasnikov, A., Ushakov, A.: New developments in commutator key exchange. In: Proceedings of the First International Conference on Symbolic Computation and Cryptography, Beijing, pp. 146\u2013150 (2008). http:\/\/www-calfor.lip6.fr\/~jcf\/Papers\/scc08.pdf"},{"key":"9_CR10","series-title":"Cryptography and Network Security Series","doi-asserted-by":"publisher","DOI":"10.1201\/b18272","volume-title":"Group Theoretic Cryptography","author":"M Gonz\u00e1lez-Vasco","year":"2015","unstructured":"Gonz\u00e1lez-Vasco, M., Steinwandt, R.: Group Theoretic Cryptography. Cryptography and Network Security Series. Chapman and Hall\/CRC Press, Boca Raton (2015)"},{"key":"9_CR11","unstructured":"Holt, D.: Answer to MathOverflow question. http:\/\/mathoverflow.net\/questions\/154761"},{"key":"9_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/3-540-44598-6_10","volume-title":"Advances in Cryptology \u2014 CRYPTO 2000","author":"KH Ko","year":"2000","unstructured":"Ko, K.H., Lee, S.J., Cheon, J.H., Han, J.W., Kang, J., Park, C.: New public-key cryptosystem using braid groups. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 166\u2013183. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44598-6_10"},{"key":"9_CR13","doi-asserted-by":"publisher","first-page":"131","DOI":"10.2307\/3062152","volume":"155","author":"D Krammer","year":"2002","unstructured":"Krammer, D.: Braid groups are linear. Ann. Math. 155, 131\u2013156 (2002)","journal-title":"Ann. Math."},{"key":"9_CR14","unstructured":"Kurt, Y.: A new key exchange primitive based on the triple decomposition problem, IACR eprint 2006\/378"},{"key":"9_CR15","first-page":"340","volume":"16","author":"YK Peker","year":"2014","unstructured":"Peker, Y.K.: A new key agreement scheme based on the triple decomposition problem. Int. J. Netw. Secur. 16, 340\u2013350 (2014)","journal-title":"Int. J. Netw. Secur."},{"key":"9_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7643-8827-0","volume-title":"Group-Based Cryptography","author":"A Myasnikov","year":"2008","unstructured":"Myasnikov, A., Shpilrain, V., Ushakov, A.: Group-Based Cryptography. Birkh\u00e4user, Basel (2008). https:\/\/doi.org\/10.1007\/978-3-7643-8827-0"},{"key":"9_CR17","volume-title":"Non-commutative Cryptography and Complexity of Group-Theoretic Problems","author":"A Myasnikov","year":"2011","unstructured":"Myasnikov, A., Shpilrain, V., Ushakov, A.: Non-commutative Cryptography and Complexity of Group-Theoretic Problems, vol. 177. American Mathematical Society Surveys and Monographs, Providence (2011)"},{"key":"9_CR18","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1515\/gcc-2015-0007","volume":"7","author":"A Myasnikov","year":"2015","unstructured":"Myasnikov, A., Roman\u2019kov, V.: A linear decomposition attack. Groups Complex. Cryptol. 7, 81\u201394 (2015)","journal-title":"Groups Complex. Cryptol."},{"key":"9_CR19","volume-title":"Algebraic Cryptography","author":"V Roman\u2019kov","year":"2013","unstructured":"Roman\u2019kov, V.: Algebraic Cryptography. Omsk State Dostoevsky University, Omsk (2013). (In Russian)"},{"key":"9_CR20","doi-asserted-by":"crossref","first-page":"35","DOI":"10.17223\/20710410\/21\/5","volume":"3","author":"V Roman\u2019kov","year":"2013","unstructured":"Roman\u2019kov, V.: Cryptanalysis of some schemes applying automorphisms. Prikladnaya Discretnaya Matematika 3, 35\u201351 (2013). (In Russian)","journal-title":"Prikladnaya Discretnaya Matematika"},{"key":"9_CR21","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1515\/gcc-2016-0017","volume":"8","author":"V Roman\u2019kov","year":"2016","unstructured":"Roman\u2019kov, V.: A nonlinear decomposition attack. Groups Complex. Cryptol. 8, 197\u2013207 (2016)","journal-title":"Groups Complex. Cryptol."},{"key":"9_CR22","doi-asserted-by":"publisher","first-page":"52","DOI":"10.17223\/20710410\/37\/4","volume":"37","author":"V Roman\u2019kov","year":"2017","unstructured":"Roman\u2019kov, V., Obzor, A.: A general encryption scheme using multiplications with cryptanalysis. Prikladnaya Discretnaya Matematika 37, 52\u201361 (2017). (In Russian)","journal-title":"Prikladnaya Discretnaya Matematika"},{"key":"9_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/978-3-540-79709-8_29","volume-title":"Computer Science \u2013 Theory and Applications","author":"V Shpilrain","year":"2008","unstructured":"Shpilrain, V.: Cryptanalysis of Stickel\u2019s key exchange scheme. In: Hirsch, E.A., Razborov, A.A., Semenov, A., Slissenko, A. (eds.) CSR 2008. LNCS, vol. 5010, pp. 283\u2013288. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-79709-8_29"},{"key":"9_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/11496137_11","volume-title":"Applied Cryptography and Network Security","author":"V Shpilrain","year":"2005","unstructured":"Shpilrain, V., Ushakov, A.: Thompson\u2019s group and public key cryptography. In: Ioannidis, J., Keromytis, A., Yung, M. (eds.) ACNS 2005. LNCS, vol. 3531, pp. 151\u2013163. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11496137_11"},{"key":"9_CR25","series-title":"Contemporary Mathematics","volume-title":"Algebraic Methods in Cryptography","year":"2006","unstructured":"Shpilrain, V., Ushakov, A.: A new key exchange protocol based on the decomposition problem. In: Gerritzen, L., Goldfeld, D., Kreuzer, M., Rosenberger, G., Shpilrain, V. (eds.) Algebraic Methods in Cryptography. Contemporary Mathematics, vol. 418, pp. 161\u2013167 (2006)"},{"key":"9_CR26","doi-asserted-by":"crossref","unstructured":"Stickel, E.: A new method for exchanging secret keys. In: Proceedings of the Third International Conference on Information Technology and Applications (ICITA 2005), pp. 426\u2013430 (2005)","DOI":"10.1109\/ICITA.2005.33"},{"key":"9_CR27","unstructured":"Tsaban, B.: The Conjugacy Problem: cryptoanalytic approaches to a problem of Dehn. minicourse, D\u00fcsseldorf University, Germany, July\u2013August 2012. http:\/\/reh.math.uni-duesseldorf.de\/~gcgta\/slides\/Tsaban_minicourses.pdf"},{"key":"9_CR28","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1007\/s00145-013-9170-9","volume":"28","author":"B Tsaban","year":"2015","unstructured":"Tsaban, B.: Polynomial-time solutions of computational problems in noncommutative-algebraic cryptography. J. Cryptol. 28, 601\u2013622 (2015)","journal-title":"J. Cryptol."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2018"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-96884-1_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,6]],"date-time":"2025-07-06T00:01:09Z","timestamp":1751760069000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-96884-1_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319968834","9783319968841"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-96884-1_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"25 July 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 August 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 August 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"38","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}