{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,22]],"date-time":"2025-11-22T11:19:49Z","timestamp":1763810389774,"version":"3.40.5"},"reference-count":36,"publisher":"Informa UK Limited","issue":"4","content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["International Journal of Computer Mathematics: Computer Systems Theory"],"published-print":{"date-parts":[[2021,10,2]]},"DOI":"10.1080\/23799927.2020.1831613","type":"journal-article","created":{"date-parts":[[2020,10,22]],"date-time":"2020-10-22T12:40:33Z","timestamp":1603370433000},"page":"260-284","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":4,"title":["WalnutDSA\u2122: a group theoretic digital signature algorithm"],"prefix":"10.1080","volume":"6","author":[{"given":"Iris","family":"Anshel","sequence":"first","affiliation":[{"name":"Veridify Security, Shelton, CT, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6866-0895","authenticated-orcid":false,"given":"Derek","family":"Atkins","sequence":"additional","affiliation":[{"name":"Veridify Security, Shelton, CT, USA"}]},{"given":"Dorian","family":"Goldfeld","sequence":"additional","affiliation":[{"name":"Veridify Security, Shelton, CT, USA"}]},{"given":"Paul E.","family":"Gunnells","sequence":"additional","affiliation":[{"name":"Veridify Security, Shelton, CT, USA"}]}],"member":"301","published-online":{"date-parts":[[2020,11,2]]},"reference":[{"key":"CIT0001","unstructured":"D. Atkins and D. Goldfeld,Addressing the Algebraic Eraser Over the Air Protocol, 2016. Available at https:\/\/eprint.iacr.org\/2016\/205.pdf."},{"key":"CIT0002","doi-asserted-by":"publisher","DOI":"10.1515\/gcc-2016-0004"},{"key":"CIT0003","unstructured":"I. Anshel, D. Atkins, D. Goldfeld, and P.E. Gunnells,Hickory Hash TM: Implementing an Instance of an Algebraic Eraser TM Hash Function on an MSP430 Microcontroller,2016. Available at https:\/\/eprint.iacr.org\/2016\/1052."},{"key":"CIT0004","first-page":"517","volume":"13","author":"Anshel I.","year":"2020","journal-title":"Adv. Math. Commun."},{"key":"CIT0005","doi-asserted-by":"publisher","DOI":"10.1090\/conm\/418\/07943"},{"key":"CIT0006","doi-asserted-by":"crossref","unstructured":"A. Ben-Zvi, S.R. Blackburn, and B. Tsaban,A practical cryptanalysis of the algebraic eraser, CRYPTO 2016, Lecture Notes in Computer Science, Vol. 9814, 2016, pp. 179\u2013189.","DOI":"10.1007\/978-3-662-53018-4_7"},{"key":"CIT0007","unstructured":"W. Beullens,WalnutDSA Official Comment, Computer Security Resource Center Post-Quantum Cryptography, National Institute of Standards and Technology, 15 January 2018, pp. 2\u20134. Available at https:\/\/csrc.nist.gov\/CSRC\/media\/Projects\/Post-Quantum-Cryptography\/documents\/round-1\/official-comments\/WalnutDSA-official-comment.pdf (accessed 9 February 2018)."},{"key":"CIT0008","unstructured":"W. Beullens,WalnutDSA Official Comment, Computer Security Resource Center Post-Quantum Cryptography, National Institute of Standards and Technology, 1 Feburary 2018, pp. 19\u201321. Available at https:\/\/csrc.nist.gov\/CSRC\/media\/Projects\/Post-Quantum-Cryptography\/documents\/round-1\/official-comments\/WalnutDSA-official-comment.pdf (accessed 9 February 2018)."},{"key":"CIT0009","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-03326-2_2"},{"key":"CIT0010","doi-asserted-by":"publisher","DOI":"10.1515\/9781400881420"},{"key":"CIT0011","doi-asserted-by":"publisher","DOI":"10.1006\/aima.1998.1761"},{"key":"CIT0012","unstructured":"S.R. Blackburn,WalnutDSA Official Comment, Computer Security Resource Center Post-Quantum Cryptography, National Institute of Standards and Technology, 22 January 2018, pp. 8\u201312. Available at https:\/\/csrc.nist.gov\/CSRC\/media\/Projects\/Post-Quantum-Cryptography\/documents\/round-1\/official-comments\/WalnutDSA-official-comment.pdf (accessed 9 February 2018)."},{"key":"CIT0013","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-39555-5_1"},{"key":"CIT0014","doi-asserted-by":"publisher","DOI":"10.1006\/aima.1997.1605"},{"key":"CIT0015","doi-asserted-by":"publisher","DOI":"10.1090\/conm\/418\/07947"},{"key":"CIT0016","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgebra.2005.02.002"},{"key":"CIT0017","doi-asserted-by":"publisher","DOI":"10.1090\/conm\/418\/07950"},{"key":"CIT0018","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237866"},{"key":"CIT0019","unstructured":"V. Hansen,Braids and Coverings: Selected Topics, With appendices by Lars G\u00e6de and Hugh R. Morton, London Mathematical Society Student Texts, Vol. 18, Cambridge University Press, Cambridge, 1989."},{"key":"CIT0020","doi-asserted-by":"crossref","unstructured":"D. Hart, D. Kim, G. Micheli, G. Pascual Perez, C. Petit, and Y. Quek,A Practical Cryptanalysis of WalnutDSA, preprint 2017. 1.","DOI":"10.1007\/978-3-319-76578-5_13"},{"key":"CIT0021","doi-asserted-by":"crossref","unstructured":"D. Hofheinz and R. Steinwandt,A practical attack on some braid group based cryptographic primitives, Public Key Cryptography, Proceedings of PKC 2003 (Yvo Desmedt, ed.), Lecture Notes in Computer Science, no. 2567, Springer-Verlag, 2002, pp. 187\u2013198.","DOI":"10.1007\/3-540-36288-6_14"},{"key":"CIT0022","doi-asserted-by":"publisher","DOI":"10.1515\/gcc-2012-0019"},{"key":"CIT0023","doi-asserted-by":"publisher","DOI":"10.1016\/j.aam.2012.03.001"},{"key":"CIT0024","unstructured":"K. Ko, D. Choi, M. Cho, and J. Lee,New signature scheme using conjugacy problem,Cryptology ePrint Archive: Report 2002\/168, 2002."},{"key":"CIT0025","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-019-00615-y"},{"key":"CIT0026","doi-asserted-by":"publisher","DOI":"10.1007\/s10711-009-9440-8"},{"key":"CIT0027","unstructured":"C. Lomont,The hidden subgroup problem \u2013 review and open problems,2004, arXiv:0411037."},{"volume-title":"Combinatorial Group Theory: Presentations of Groups in Terms of Generators and Relations","year":"1966","author":"Magnus W.","key":"CIT0028"},{"key":"CIT0029","unstructured":"S.P. Merz and C. Petit,Factoring products of Braids via Garside normal form, 2018. Available at https:\/\/eprint.iacr.org\/2018\/1142."},{"key":"CIT0030","doi-asserted-by":"publisher","DOI":"10.1145\/1198513.1198525"},{"key":"CIT0031","doi-asserted-by":"publisher","DOI":"10.1090\/conm\/233\/03427"},{"key":"CIT0032","doi-asserted-by":"crossref","unstructured":"C. Mulland, B. Tsaban,SL2 homomorphic hash functions,Worst case to average case reduction and short collision search, arXiv:1306.5646v3 [cs.CR], 2015.","DOI":"10.1007\/s10623-015-0129-8"},{"key":"CIT0033","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(91)90011-M"},{"key":"CIT0034","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795293172"},{"key":"CIT0035","doi-asserted-by":"publisher","DOI":"10.1049\/iet-ifs.2008.0090"},{"key":"CIT0036","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46416-6_44"}],"container-title":["International Journal of Computer Mathematics: Computer Systems Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/23799927.2020.1831613","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,16]],"date-time":"2024-08-16T08:02:32Z","timestamp":1723795352000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/23799927.2020.1831613"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,2]]},"references-count":36,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,10,2]]}},"alternative-id":["10.1080\/23799927.2020.1831613"],"URL":"https:\/\/doi.org\/10.1080\/23799927.2020.1831613","relation":{},"ISSN":["2379-9927","2379-9935"],"issn-type":[{"type":"print","value":"2379-9927"},{"type":"electronic","value":"2379-9935"}],"subject":[],"published":{"date-parts":[[2020,11,2]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=tcom20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=tcom20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2020-06-26","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-08-14","order":1,"name":"revised","label":"Revised","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-09-13","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-11-02","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}