{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T05:00:06Z","timestamp":1764997206993,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030033255"},{"type":"electronic","value":"9783030033262"}],"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.springer.com\/tdm"},{"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.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-03326-2_2","type":"book-chapter","created":{"date-parts":[[2018,10,26]],"date-time":"2018-10-26T19:08:14Z","timestamp":1540580894000},"page":"35-61","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Practical Attacks Against the Walnut Digital Signature Scheme"],"prefix":"10.1007","author":[{"given":"Ward","family":"Beullens","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simon R.","family":"Blackburn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,10,27]]},"reference":[{"key":"2_CR1","unstructured":"About SecureRF. https:\/\/www.securerf.com\/about-us\/. Accessed 08 Mar 2018"},{"key":"2_CR2","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":"2_CR3","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":"2_CR4","first-page":"1","volume":"418","author":"I Anshel","year":"2007","unstructured":"Anshel, I., Anshel, M., Goldfeld, D., Lemieux, S.: Key agreement, the Algebraic Eraser\u2122, and lightweight cryptography. Contemp. Math. 418, 1\u201334 (2007)","journal-title":"Contemp. Math."},{"key":"2_CR5","unstructured":"Anshel, I., Atkins, D., Goldfeld, D., Gunnells, P.E.: WalnutDSA\u2122: a quantum-resistant digital signature algorithm. IACR eprint 2017\/058 (version: 30-Nov-2017)"},{"key":"2_CR6","unstructured":"Anshel, I., Atkins, D., Goldfeld, D., Gunnells, P.E.: WalnutDSA\u2122: a quantum-resistant digital signature algorithm. IACR eprint 2017\/058 (version: 18-Sept-2017)"},{"issue":"1","key":"2_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1515\/gcc-2016-0004","volume":"8","author":"I Anshel","year":"2016","unstructured":"Anshel, I., Atkins, D., Goldfeld, D., Gunnells, P.E.: A class of hash functions based on the Algebraic Eraser\u2122. Groups Complex. Cryptol. 8(1), 1\u20137 (2016)","journal-title":"Groups Complex. Cryptol."},{"key":"2_CR8","unstructured":"Anshel, I., Atkins, D., Goldfeld, D., Gunnells, P.E.: The Walnut digital signature algorithm\u2122 specifcation. Submitted to NIST PQC project (2017)"},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"101","DOI":"10.2307\/1969218","volume":"48","author":"E Artin","year":"1947","unstructured":"Artin, E.: Theory of braids. Ann. Math. 48, 101\u2013126 (1947)","journal-title":"Ann. Math."},{"key":"2_CR10","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":"2_CR11","unstructured":"Ben-Zvi, A., Kalka, A., Tsaban, B.: Cryptanalysis via algebraic spans. IACR eprint 41 (2014)"},{"key":"2_CR12","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"},{"issue":"1","key":"2_CR13","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."},{"key":"2_CR14","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.H., 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":"2_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/3-540-45450-0_15","volume-title":"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., Seberry, J. (eds.) ACISP 2002. LNCS, vol. 2384, pp. 176\u2013189. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45450-0_15"},{"key":"2_CR16","unstructured":"Hughes, J., Tannenbaum, A.: Length-based attacks for certain group based encryption rewriting systems. arXiv preprint cs\/0306032 (2003)"},{"key":"2_CR17","unstructured":"Kalka, A., Teicher, M., Tsaban, B.: Cryptanalysis of the Algebraic Eraser and short expressions of permutations as products. Arxiv preprint (2008)"},{"key":"2_CR18","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":"2_CR19","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":"2_CR20","unstructured":"National Institute for Standards and Technology (NIST): Post-quantum crypto standardization (2016). http:\/\/csrc.nist.gov\/groups\/ST\/post-quantum-crypto\/"},{"issue":"3","key":"2_CR21","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/BF01933667","volume":"15","author":"JM Pollard","year":"1975","unstructured":"Pollard, J.M.: A Monte Carlo method for factorization. BIT Numer. Math. 15(3), 331\u2013334 (1975)","journal-title":"BIT Numer. Math."},{"issue":"2","key":"2_CR22","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1137\/0211030","volume":"11","author":"R Sedgewick","year":"1982","unstructured":"Sedgewick, R., Szymanski, T.G., Yao, A.C.: The complexity of finding cycles in periodic functions. SIAM J. Comput. 11(2), 376\u2013390 (1982)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"2_CR23","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(3), 601\u2013622 (2015)","journal-title":"J. Cryptol."},{"issue":"1","key":"2_CR24","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."},{"issue":"5","key":"2_CR25","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/s00200-003-0135-3","volume":"14","author":"MIG Vasco","year":"2004","unstructured":"Vasco, M.I.G., Steinwandt, R.: A reaction attack on a public key cryptosystem based on the word problem. Appl. Algebr. Eng. Commun. Comput. 14(5), 335\u2013340 (2004)","journal-title":"Appl. Algebr. Eng. Commun. Comput."},{"key":"2_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/3-540-39568-7_3","volume-title":"Advances in Cryptology","author":"NR Wagner","year":"1985","unstructured":"Wagner, N.R., Magyarik, M.R.: A public-key cryptosystem based on the word problem. In: Blakley, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol. 196, pp. 19\u201336. Springer, Heidelberg (1985). https:\/\/doi.org\/10.1007\/3-540-39568-7_3"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2018"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-03326-2_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,22]],"date-time":"2021-11-22T01:02:58Z","timestamp":1637542978000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-03326-2_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030033255","9783030033262"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-03326-2_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"27 October 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ASIACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Theory and Application of Cryptology and Information Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brisbane, QLD","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","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":"2 December 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 December 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"websubrev","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"234","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"65","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.0","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"17.0","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}