References
- D. Atkins and D. Goldfeld, Addressing the Algebraic Eraser Over the Air Protocol, 2016. Available at https://eprint.iacr.org/2016/205.pdf.
- I. Anshel, D. Atkins, D. Goldfeld, and P.E. Gunnells, A class of Hash functions based on the algebraic eraser, Groups Complex. Cryptol. 8(1) (2016), pp. 1–7. doi: https://doi.org/10.1515/gcc-2016-0004
- 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.
- I. Anshel, D. Atkins, D. Goldfeld, and P.E. Gunnells, Ironwood meta key agreement and authentication protocol, Adv. Math. Commun. 13 (2020), pp. 517–558. doi:https://doi.org/10.3934/amc.2020073.
- I. Anshel, M. Anshel, D. Goldfeld, and S. Lemieux, Key Agreement, the Algebraic Eraser TM, and Lightweight Cryptography, Algebraic methods in cryptography, Contemp. Math., Vol. 418, Amer. Math. Soc., Providence, RI, 2006, pp. 1–34.
- 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–189.
- W. Beullens, WalnutDSA Official Comment, Computer Security Resource Center Post-Quantum Cryptography, National Institute of Standards and Technology, 15 January 2018, pp. 2–4. 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).
- W. Beullens, WalnutDSA Official Comment, Computer Security Resource Center Post-Quantum Cryptography, National Institute of Standards and Technology, 1 Feburary 2018, pp. 19–21. 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).
- W. Beullens and S. Blackburn, Practical attacks against the Walnut digital signature scheme, pre-print, May, 2018.
- J. Birman, Braids, Links and Mapping Class Groups, Annals of Mathematics Studies, Princeton University Press, 1974.
- J. Birman, K.H. Ko, and S.J. Lee, A new approach to the word and conjugacy problems in the braid groups, Adv. Math. 139(2) (1998), pp. 322–353. doi: https://doi.org/10.1006/aima.1998.1761
- S.R. Blackburn, WalnutDSA Official Comment, Computer Security Resource Center Post-Quantum Cryptography, National Institute of Standards and Technology, 22 January 2018, pp. 8–12. 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).
- S.R. Blackburn and M.J.B. Robshaw, On the security of the algebraic eraser tag authentication protocol, 14th International Conference on Applied Cryptography and Network Security (ACNS 2016), to appear. Available at http://eprint.iacr.org/2016/091.
- P. Dehornoy, A fast method for comparing braids, Adv. Math. 125(2) (1997), pp. 200–235. doi: https://doi.org/10.1006/aima.1997.1605
- D. Garber, S. Kaplan, M. Teicher, B. Tsaban, and U. Vishne, Length-based conjugacy search in the braid group, Algebraic methods in cryptography, Contemp. Math., Vol. 418, Amer. Math. Soc., Providence, RI, 2006, pp. 75–87.
- V. Gebhardt, A new approach to the conjugacy problem in Garside groups, J. Algebra 292(1) (2005), pp. 282–302. doi: https://doi.org/10.1016/j.jalgebra.2005.02.002
- A. Groch, D. Hofheinz, and R. Steinwandt, A Practical Attack on the Root Problem in Braid Groups, Algebraic methods in cryptography, Contemp. Math., Vol. 418, Amer. Math. Soc., Providence, RI, 2006, pp. 121–131.
- L.K. Grover, A fast quantum mechanical algorithm for database search, Proceedings, 28th Annual ACM Symposium on the Theory of Computing, May 1996, p. 212.
- V. Hansen, Braids and Coverings: Selected Topics, With appendices by Lars Gæde and Hugh R. Morton, London Mathematical Society Student Texts, Vol. 18, Cambridge University Press, Cambridge, 1989.
- D. Hart, D. Kim, G. Micheli, G. Pascual Perez, C. Petit, and Y. Quek, A Practical Cryptanalysis of WalnutDSA, preprint 2017. 1.
- 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–198.
- D. Kahrobaei and C Koupparis, Non-commutative digital signatures, Groups Complex. Cryptol. 4(2) (2012), pp. 377–384. doi: https://doi.org/10.1515/gcc-2012-0019
- A. Kalka, M. Teicher, and B. Tsaban, Short expressions of permutations as products and cryptanalysis of the algebraic eraser, Adv. Appl. Math. 49 (2012), pp. 57–76. doi: https://doi.org/10.1016/j.aam.2012.03.001
- K. Ko, D. Choi, M. Cho, and J. Lee, New signature scheme using conjugacy problem, Cryptology ePrint Archive: Report 2002/168, 2002.
- M. Kotov, A. Menshov, and A. Ushakov, An attack on the Walnut digital signature algorithm, Designs Codes Cryptogr. 87 (2019), pp. 2231–2250. Available at https://doi.org/https://doi.org/10.1007/s10623-019-00615-y.
- C.J. Leininger and D. Margalit, Two-generator subgroups of the pure braid group, Geometriae Dedicata 147 (2010), pp. 107–113. Available at https://doi-org.ezproxy.cul.columbia.edu/https://doi.org/10.1007/s10711-009-9440-8.
- C. Lomont, The hidden subgroup problem – review and open problems, 2004, arXiv:0411037.
- W. Magnus, A. Karrass, and D. Solitar, Combinatorial Group Theory: Presentations of Groups in Terms of Generators and Relations, Interscience Publishers (John Wiley & Sons, Inc., New York–London–Sydney, 1966.
- S.P. Merz and C. Petit, Factoring products of Braids via Garside normal form, 2018. Available at https://eprint.iacr.org/2018/1142.
- C. Moore, D. Rockmore, and A. Russell, Generic quantum Fourier transforms, ACM Trans. Algorithms 2(4) (2006), pp. 707–723. doi: https://doi.org/10.1145/1198513.1198525
- H.R. Morton, The Multivariable Alexander Polynomial for a Closed Braid, Low-dimensional Topology, (Funchal, 1998), Contemp. Math., Vol. 233, Amer. Math. Soc., Providence, RI, 1999, pp. 167–172.
- C. Mulland, B. Tsaban, SL2 homomorphic hash functions , Worst case to average case reduction and short collision search, arXiv:1306.5646v3 [cs.CR], 2015.
- M.S. Paterson and A.A. Razborov, The set of minimal braids is co-NP-Complete, J. Algorithms12 (1991), pp. 393–408. doi: https://doi.org/10.1016/0196-6774(91)90011-M
- P. Shor, Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer, SIAM J. Comput. 26 (1997), pp. 1484–1509. doi: https://doi.org/10.1137/S0097539795293172
- B.C. Wang and Y.P. Hu, Signature scheme based on the root extraction problem over braid groups, IET Inform. Security 3 (2009), pp. 53–59. doi: https://doi.org/10.1049/iet-ifs.2008.0090
- G. Zémor, Hash functions and graphs with large girths, Eurocrypt '91, Lecture Notes in Computer Science, Vol. 547, 1991, pp. 508–511.