A cryptographic application of the Thurston norm

References

• J.W. Aaber and N. Dunfield, Closed surface bundles of least volume, Algebr. Geom. Topol. 10(4) (2010), pp. 2315–2342. doi: 10.2140/agt.2010.10.2315
   Web of Science ®Google Scholar
• Y. Algom-Kfir, E. Hironaka and K. Rafi, Digraphs and cycle polynomials for free-by-cyclic groups, Geom. Topol. 19(2) (2015), pp. 1111–1154. doi: 10.2140/gt.2015.19.1111
   Web of Science ®Google Scholar
• I. Anshel, M. Anshel and D. Goldfeld, An algebraic method for public-key cryptography, Math. Res. Let. 6 (1999), pp. 287–291. doi: 10.4310/MRL.1999.v6.n3.a3
   Web of Science ®Google Scholar
• I. Anshel, D. Atkins, D. Goldfeld and P. Gunnells, WalnutDSATM: A quantum resistant group theoretic digital signature algorithm, 2016. Available at https://www.nist.gov/sites/default/files/documents/2016/10/19/atkins-paper-lwc2016.pdf.
   Google Scholar
• G. Baumslag, B. Fine and X. Xu, Cryptosystems using linear groups, Appl. Algebra Eng. Comm. Comput. 17 (2006), pp. 205–2017. doi: 10.1007/s00200-006-0003-z
   Web of Science ®Google Scholar
• J.C. Birget, S.S. Magliveras and M. Sramka, On public-key cryptosystems based on combinatorial group theory, Tatra Mt. Math. Publ. 33 (2006), pp. 137–148.
   Google Scholar
• K. Brown, Trees, valuations, and the Bieri-Neumann-Strebel invariant, Inv. Math. 90 (1987), pp. 479–504. doi: 10.1007/BF01389176
   Web of Science ®Google Scholar
• B. Cavallo and D. Kahrobaei, Secret sharing using the shortlex order and non-commutative groups, Contemp. Math. 633 (2015), pp. 1–8. AMS. doi: 10.1090/conm/633/12646
   Google Scholar
• I. Chatterji, D. Kahrobaei and N.Y. Lu, Cryptosystems using subgroup distortion, Theor. Appl. Inform. 29 (2017), pp. 14–24.
   Google Scholar
• S. Dowdall, I. Kapovich and C. Leininger, McMullen polynomials and Lipschitz flows for free-by-cyclic groups, J. Eur. Math. Soc. 19(11) (2017), pp. 3253–3353. doi: 10.4171/JEMS/739
   Web of Science ®Google Scholar
• B. Eick and D. Kahrobaei, Polycyclic groups: A new platform for cryptography, Technical report (60 citations), 2004. Available at http://math.gr/0411077.
   Google Scholar
• A. Fathi, F. Laudenbach, V. Poenaru,  Travaux de Thurston sur les surfaces, Séminaire Orsay. Astérisque, pp. 66–67. Société Mathématique de France, Paris, 1979.
   Google Scholar
• R. Flores and D. Kahrobaei, Cryptography with right-angled Artin groups, Theor. Appl. Inform. 28(3) (2016), pp. 8–16.
   Google Scholar
• R. Flores, D. Kahrobaei and T. Koberda, Algorithmic problems in right-angled Artin groups: complexity and applications, J. Algebra 519 (2019), pp. 111–129. doi: 10.1016/j.jalgebra.2018.10.023
   Web of Science ®Google Scholar
• J. Gryak and D. Kahrobaei, The status of the polycyclic group-based cryptography: A survey and open problems, Groups Complex. Cryptol. 8 (2016), pp. 171–186. doi: 10.1515/gcc-2016-0013
   Google Scholar
• M. Habeeb, D. Kahrobaei, C. Koupparis and V. Shpilrain, Public key exchange using semidirect product of (SEMI) groups, ACNS 2013, Applied Cryptography and Network Security, LNCS Vol. 7954, 2013, pp. 475–486.
   Google Scholar
• M. Habeeb, D. Kahrobaei and V. Shpilrain, A secret sharing scheme based on group-presentation and word problem, Contemp. Math. AMS 582 (2012), pp. 143–150. doi: 10.1090/conm/582/11557
   Google Scholar
• D. Hart, D.H. Kim, G. Micheli, A Practical Cryptanalysis of WalnutDSA, LNCS, PKC, Rio de Janeiro, 2018.
   Google Scholar
• D. Kahrobaei and B. Khan, A Non-Commutative Generalization of the El Gamal Key Exchange using Polycyclic Groups, Proceeding of IEEE, GLOBECOM, 2006, pp. 1–5.
   Google Scholar
• D. Kahrobaei and C. Koupparis, Non-commutative digital signatures using non-commutative groups, Groups Complex. Cryptol. 4 (2012), pp. 377–384. doi: 10.1515/gcc-2012-0019
   Google Scholar
• D. Kahrobaei and K. Mallahi-Karai, Some applications of arithmetic groups in cryptography, Groups Complex. Cryptol. 11(1) (2019), pp. 1–9. doi: 10.1515/gcc-2019-2002
   Google Scholar
• D. Kahrobaei and V. Shpilrain, Using semidirect product of (semi)groups in public key cryptography, Computability in Europe 2016, LNCS 9709, 2016, pp. 132–141.
   Google Scholar
• E. Lanneau and F. Valdez, Computing the Teichmüller polynomial, J. Eur. Math. Soc. (JEMS) 19(12) (2017), pp. 3867–3910. doi: 10.4171/JEMS/756
   Web of Science ®Google Scholar
• C. T. McMullen, Polynomial invariants for fibered 3-manifolds and Teichm¨uller geodesics for foliations, Ann. Sci. Ecole Norm. Sup. 33(4) (2000), pp. 519–560.
   Google Scholar
• F. Levy-dit-Vehel, L. Perret, On the Wagner-Magyarik cryptosystem, in Coding and Cryptography, Ø. Ytrehus, ed., LNCS, Vol. 3969, pp. 316–329, Springer, Berlin, 2006.
   Google Scholar
• G. Petrides, Cryptanalysis of the public key cryptosystem based on the word problem on the Grigorchuk groups, Cryptography and Coding, 2003, pp. 234–244.
   Google Scholar
• V. Roman'kov, An improved version of the AAG cryptographic protocol, Groups Complex. Cryptol. 11 (2019), pp. 35–42.
   Google Scholar
• V. Shpilrain, A. Ushakov, Thompson's Group and Public Key Cryptography, ACNS, New York, 2005.
   Google Scholar
• V. Shpilrain and G. Zapata, Combinatorial group theory and public key cryptography, Appl. Algebra Engin. 17 (2006), pp. 291–302. doi: 10.1007/s00200-006-0006-9
   Web of Science ®Google Scholar
• W.P. Thurston, A norm for the homology of 3-manifolds, Mem. Am. Math. Soc. 59(339) (1986), pp. 99–130. i–vi.
   Web of Science ®Google Scholar
• B. Tsaban, Polynomial-time solutions of computational problems in noncommutative-algebraic cryptography, J. Cryptology 28(3) (2015), pp. 601–622. doi: 10.1007/s00145-013-9170-9
   Web of Science ®Google Scholar
• N.R. Wagner and M.R. Magyarik, A Public-Key Cryptosystem Based on the Word Problem, in Advances in Cryptology. CRYPTO 1984, G.R. Blakley, D. Chaum, eds., Lecture Notes in Computer Science, Vol. 196, Springer, Berlin, 1985.
   Google Scholar