{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T05:00:36Z","timestamp":1764997236030,"version":"3.40.3"},"publisher-location":"Cham","reference-count":44,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030172589"},{"type":"electronic","value":"9783030172596"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-17259-6_22","type":"book-chapter","created":{"date-parts":[[2019,4,7]],"date-time":"2019-04-07T23:02:48Z","timestamp":1554678168000},"page":"646-678","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Factoring Products of Braids via Garside Normal Form"],"prefix":"10.1007","author":[{"given":"Simon-Philipp","family":"Merz","sequence":"first","affiliation":[]},{"given":"Christophe","family":"Petit","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,4,6]]},"reference":[{"key":"22_CR1","unstructured":"About SecureRF. https:\/\/www.securerf.com\/about-us\/. Accessed 21 Nov 2018"},{"key":"22_CR2","unstructured":"Anshel, I., Atkins, D., Goldfeld, P., Gunnels, D.: Kayawood, a key agreement protocol (2017). Preprint: https:\/\/eprint.iacr.org\/2017\/1162. Version 30 Nov 2017"},{"key":"22_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/3-540-45353-9_2","volume-title":"Topics in Cryptology \u2014 CT-RSA 2001","author":"I Anshel","year":"2001","unstructured":"Anshel, I., Anshel, M., Fisher, B., Goldfeld, D.: New key agreement protocols in braid group cryptography. In: Naccache, D. (ed.) CT-RSA 2001. LNCS, vol. 2020, pp. 13\u201327. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45353-9_2"},{"key":"22_CR4","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\u2013292 (1999)","journal-title":"Math. Res. Lett."},{"key":"22_CR5","first-page":"1","volume":"418","author":"I Anshel","year":"2007","unstructured":"Anshel, I., Anshel, M., Goldfeld, D., Lemieux, S.: Key agreement, the algebraic eraser, and lightweight cryptography. Contemp. Math. 418, 1\u201334 (2007)","journal-title":"Contemp. Math."},{"key":"22_CR6","unstructured":"Anshel, I., Atkins, D., Goldfeld, D., Gunnells, P.E.: WalnutDSA: a quantum resistant group theoretic digital signature algorithm (2017). Preprint available at https:\/\/eprint.iacr.org\/2017\/058, 30 Nov 2017"},{"key":"22_CR7","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/BF02950718","volume":"4","author":"E Artin","year":"1925","unstructured":"Artin, E.: Theorie der Z\u00f6pfe. Abhandlungen aus dem mathematischen Seminar der Universit\u00e4t Hamburg. 4, 47\u201372 (1925)","journal-title":"Abhandlungen aus dem mathematischen Seminar der Universit\u00e4t Hamburg."},{"key":"22_CR8","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":"22_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/978-3-319-96884-1_9","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"A Ben-Zvi","year":"2018","unstructured":"Ben-Zvi, A., Kalka, A., Tsaban, B.: Cryptanalysis via algebraic spans. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10991, pp. 255\u2013274. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96884-1_9"},{"key":"22_CR10","unstructured":"Beullens, W., Blackburn, S.: Practical attacks against the Walnut digital signature scheme (2018). Accepted to Asiacrypt 2018. Preprint: https:\/\/eprint.iacr.org\/2018\/318\/20180404"},{"issue":"2","key":"22_CR11","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1006\/aima.1998.1761","volume":"139","author":"J Birman","year":"1998","unstructured":"Birman, J., Ko, K.H., Lee, S.J.: A new approach to the word and conjugacy problems in the braid groups. Adv. Math. 139(2), 322\u2013353 (1998)","journal-title":"Adv. Math."},{"key":"22_CR12","doi-asserted-by":"crossref","DOI":"10.1515\/9781400881420","volume-title":"Braids, Links, and Mapping Class Groups. (AM-82)","author":"JS Birman","year":"1975","unstructured":"Birman, J.S.: Braids, Links, and Mapping Class Groups. (AM-82), vol. 82. Princeton University Press, Princeton (1975)"},{"issue":"3","key":"22_CR13","doi-asserted-by":"publisher","first-page":"221","DOI":"10.4171\/GGD\/12","volume":"1","author":"JS Birman","year":"2007","unstructured":"Birman, J.S., Gebhardt, V., Gonz\u00e1lez-Meneses, J.: Conjugacy in Garside groups I: cyclings, powers and rigidity. Groups Geom. Dyn. 1(3), 221\u2013279 (2007)","journal-title":"Groups Geom. Dyn."},{"issue":"3\u20134","key":"22_CR14","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(3\u20134), 235\u2013265 (1997)","journal-title":"J. Symb. Comput."},{"issue":"06","key":"22_CR15","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1142\/S0218216508006373","volume":"17","author":"X Bressaud","year":"2008","unstructured":"Bressaud, X.: A normal form for braids. J. Knot Theory Ramif. 17(06), 697\u2013732 (2008)","journal-title":"J. Knot Theory Ramif."},{"key":"22_CR16","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/BF02940722","volume":"11","author":"W Burau","year":"1935","unstructured":"Burau, W.: \u00dcber Zopfgruppen und gleichsinnig verdrillte Verkettungen. Abhandlungen aus dem Mathematischen Seminar der Universit\u00e4t Hamburg. 11, 179\u2013186 (1935)","journal-title":"Abhandlungen aus dem Mathematischen Seminar der Universit\u00e4t Hamburg."},{"issue":"2","key":"22_CR17","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1006\/aima.1997.1605","volume":"125","author":"P Dehornoy","year":"1997","unstructured":"Dehornoy, P.: A fast method for comparing braids. Adv. Math. 125(2), 200\u2013235 (1997)","journal-title":"Adv. Math."},{"issue":"11","key":"22_CR18","doi-asserted-by":"publisher","first-page":"2413","DOI":"10.1016\/j.jpaa.2008.03.027","volume":"212","author":"P Dehornoy","year":"2008","unstructured":"Dehornoy, P.: Alternating normal forms for braids and locally Garside monoids. J. Pure Appl. Algebra 212(11), 2413\u20132439 (2008)","journal-title":"J. Pure Appl. Algebra"},{"key":"22_CR19","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/978-3-540-88702-7_6","volume-title":"Post-Quantum Cryptography","author":"J Ding","year":"2009","unstructured":"Ding, J., Yang, B.Y.: Multivariate public key cryptography. In: Bernstein, D.J., Buchmann, J., Dahmen, E. (eds.) Post-Quantum Cryptography, pp. 193\u2013241. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-540-88702-7_6"},{"issue":"180","key":"22_CR20","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1093\/qmath\/45.4.479","volume":"45","author":"EA Elrifai","year":"1994","unstructured":"Elrifai, E.A., Morton, H.R.: Algorithms for positive braids. Q. J. Math. 45(180), 479\u2013498 (1994)","journal-title":"Q. J. Math."},{"key":"22_CR21","doi-asserted-by":"crossref","unstructured":"Epstein, D., Cannon, J., Holt, D., Levy, S., Paterson, M., Thurston, W.: Word Processing in Groups (1992)","DOI":"10.1201\/9781439865699"},{"key":"22_CR22","doi-asserted-by":"crossref","unstructured":"Garber, D.: Braid group cryptography. In: Braids: Introductory Lectures On Braids, Configurations and Their Applications, pp. 329\u2013403. World Scientific (2010)","DOI":"10.1142\/9789814291415_0006"},{"issue":"1","key":"22_CR23","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1093\/qmath\/20.1.235","volume":"20","author":"FA Garside","year":"1969","unstructured":"Garside, F.A.: The braid group and other groups. Q. J. Math. 20(1), 235\u2013254 (1969)","journal-title":"Q. J. Math."},{"issue":"1","key":"22_CR24","doi-asserted-by":"publisher","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 292(1), 282\u2013302 (2005)","journal-title":"J. Algebra"},{"issue":"1","key":"22_CR25","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/s00209-009-0502-2","volume":"265","author":"V Gebhardt","year":"2010","unstructured":"Gebhardt, V., Gonz\u00e1lez-Meneses, J.: The cyclic sliding operation in Garside groups. Mathematische Zeitschrift 265(1), 85\u2013114 (2010)","journal-title":"Mathematische Zeitschrift"},{"issue":"1","key":"22_CR26","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/j.jcta.2012.07.003","volume":"120","author":"V Gebhardt","year":"2013","unstructured":"Gebhardt, V., Gonz\u00e1lez-Meneses, J.: Generating random braids. J. Comb. Theory Ser. A 120(1), 111\u2013128 (2013)","journal-title":"J. Comb. Theory Ser. A"},{"key":"22_CR27","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.jalgebra.2013.10.008","volume":"408","author":"V Gebhardt","year":"2014","unstructured":"Gebhardt, V., Tawn, S.: Normal forms of random braids. J. Algebra 408, 115\u2013137 (2014)","journal-title":"J. Algebra"},{"key":"22_CR28","unstructured":"Goldwasser, S., Bellare, M.: Lecture notes on cryptography. Summer course \u201cCryptography and computer security\u201d at MIT (1996)"},{"key":"22_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/978-3-319-76578-5_13","volume-title":"Public-Key Cryptography \u2013 PKC 2018","author":"D Hart","year":"2018","unstructured":"Hart, D., Kim, D., Micheli, G., Pascual-Perez, G., Petit, C., Quek, Y.: A practical cryptanalysis of WalnutDSA$$^{\\text{ TM }}$$. In: Abdalla, M., Dahab, R. (eds.) PKC 2018. LNCS, vol. 10769, pp. 381\u2013406. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-76578-5_13"},{"key":"22_CR30","unstructured":"Hughes, J., Tannenbaum, A.: Length-based attacks for certain group based encryption rewriting systems. arXiv preprint cs\/0306032 (2003)"},{"issue":"1","key":"22_CR31","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.aam.2012.03.001","volume":"49","author":"A Kalka","year":"2012","unstructured":"Kalka, A., Teicher, M., Tsaban, B.: Short expressions of permutations as products and cryptanalysis of the Algebraic Eraser. Adv. Appl. Math. 49(1), 57\u201376 (2012)","journal-title":"Adv. Appl. Math."},{"issue":"2","key":"22_CR32","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"DE Knuth","year":"1977","unstructured":"Knuth, D.E., Morris Jr., J.H., Pratt, V.R.: Fast pattern matching in strings. SIAM J. Comput. 6(2), 323\u2013350 (1977)","journal-title":"SIAM J. Comput."},{"key":"22_CR33","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.S., 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":"22_CR34","unstructured":"Kotov, M., Menshov, A., Ushakov, A.: An attack on the Walnut digital signature algorithm. Des. Codes Crypt. 1\u201320 (2018)"},{"key":"22_CR35","first-page":"114","volume":"44","author":"R McEliece","year":"1978","unstructured":"McEliece, R.: A public-key cryptosystem based on algebraic coding theory. Deep. Space Netw. Prog. Rep. 44, 114\u2013116 (1978)","journal-title":"Deep. Space Netw. Prog. Rep."},{"key":"22_CR36","unstructured":"Merz, S.P.: Non obfuscating power of Garside normal forms (2018). GitHub repository at https:\/\/github.com\/SimonMerz\/Non-obfuscating-power-of-Garside-normal-forms"},{"key":"22_CR37","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/978-3-540-88702-7_5","volume-title":"Post-Quantum Cryptography","author":"D Micciancio","year":"2009","unstructured":"Micciancio, D., Regev, O.: Lattice-based cryptography. In: Bernstein, D.J., Buchmann, J., Dahmen, E. (eds.) Post-Quantum Cryptography, pp. 147\u2013191. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-540-88702-7_5"},{"key":"22_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/978-3-540-71677-8_6","volume-title":"Public Key Cryptography \u2013 PKC 2007","author":"AD Myasnikov","year":"2007","unstructured":"Myasnikov, A.D., Ushakov, A.: Length based attack and braid groups: cryptanalysis of Anshel-Anshel-Goldfeld key exchange protocol. In: Okamoto, T., Wang, X. (eds.) PKC 2007. LNCS, vol. 4450, pp. 76\u201388. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-71677-8_6"},{"key":"22_CR39","unstructured":"National Institute for Standards and Technology (NIST): Post-quantum crypto standardization (2016). https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography"},{"key":"22_CR40","unstructured":"NIST PQC Forum. https:\/\/groups.google.com\/a\/list.nist.gov\/forum\/#!forum\/pqc-forum. Accessed 21 Nov 2018"},{"key":"22_CR41","unstructured":"Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factoring. In: 35th Annual Symposium on Foundations of Computer Science, 1994 Proceedings, pp. 124\u2013134. IEEE (1994)"},{"key":"22_CR42","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"},{"issue":"2","key":"22_CR43","doi-asserted-by":"publisher","first-page":"215","DOI":"10.3934\/amc.2010.4.215","volume":"4","author":"A Stolbunov","year":"2010","unstructured":"Stolbunov, A.: Constructing public-key cryptographic schemes based on class group action on a set of isogenous elliptic curves. Adv. Math. Commun. 4(2), 215\u2013235 (2010)","journal-title":"Adv. Math. Commun."},{"issue":"1","key":"22_CR44","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/PL00003816","volume":"12","author":"PC Van Oorschot","year":"1999","unstructured":"Van Oorschot, P.C., Wiener, M.J.: Parallel collision search with cryptanalytic applications. J. Cryptol. 12(1), 1\u201328 (1999)","journal-title":"J. Cryptol."}],"container-title":["Lecture Notes in Computer Science","Public-Key Cryptography \u2013 PKC 2019"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-17259-6_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T12:40:23Z","timestamp":1709815223000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-17259-6_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030172589","9783030172596"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-17259-6_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"6 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PKC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"IACR International Workshop on Public Key Cryptography","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Beijing","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 April 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 April 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pkc2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/pkc.iacr.org\/2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}