Alexander Ushakov

Assistant Professor

Department of Mathematical Sciences
Stevens Institute of Technology

(2) A. G. Myasnikov, V. Shpilrain, and A. Ushakov, Non-commutative Cryptography and Complexity of Group-theoretic Problems, AMS, December 2011.
(1) A. G. Myasnikov, V. Shpilrain, and A. Ushakov, Group-based cryptography, Birkhauser, 2008.
(22)V. Diekert, J. Laun, A. Ushakov, Efficient algorithms for highly compressed data: The Word Problem in Higman's group is in P, accepted to STACS 2012.
(21)A. G. Myasnikov, A. Ushakov, and D. Won, Power Circuits, Exponential Algebra, and Time Complexity, submitted to International Journal of Algebra and Computation.
(20)A. G. Myasnikov, A. Ushakov, and D. Won, The Word Problem in the Baumslag group with a non-elementary Dehn function is polynomial time decidable, to appear in Journal of Algebra.
(19)A. G. Miasnikov, A. Ushakov, Random van Kampen diagrams and algorithmic problems in groups, Group-Complexity-Cryptology, 3 (2011), 121--185.
(18)N. Mosina, A. Ushakov, Strong law of large numbers on graphs and groups, Group-Complexity-Cryptology, 3 (2011), 67--103.
(17)N. Mosina, A. Ushakov, Mean set attack: Cryptanalysis of Sibert et al authentication protocol, Journal of Mathematical Cryptology, 4 (2010), 149--174.
(16)A. G. Miasnikov, I. Lysenok, A. Ushakov, The Conjugacy Problem in the Grigorchuk Group is polynomial time decidable, Groups-Geometry-Dynamics, 4 (2010), 813--833.
(15)A. Miasnikov, V. Roman'kov, A. Ushakov, A. Vershik, The Word and Geodesic Problems in Free Solvable GroupsTransactions of AMS, 362 (2010), 4655--4682.
(14)J. Longrigg, A. Ushakov, A Practical Attack on a Certain Braid Group Based Shifted Conjugacy Authentication Protocol, Groups-Complexity-Cryptology, 1 (2009), 275--286.
(13)J. Longrigg, A. Ushakov, Cryptanalysis of shifted conjugacy authentication protocol. Journal of Mathematical Cryptology, 2 (2008), 107--114.
(12)R. Gilman, A. D. Miasnikov, A. G. Miasnikov, A. Ushakov, New developments in Commutator Key Exchange, Proceedings of the First International Conference on Symbolic Computation and Cryptography, Beijing, 2008, 146--150.
(11)A. D. Miasnikov, A. Ushakov, Cryptanalysis of Anshel-Anshel-Goldfeld-Lemieux key agreement protocol, Groups-Complexity-Cryptology, 1 (2008), 63--75.
(10)V. Shpilrain, A. Ushakov, An authentication scheme based on the twisted conjugacy problem, ACNS 2008, LNCS 5037 (2008), 366--372.
(9)A. G. Miasnikov, A. Ushakov, Random subgroups and analysis of the length-based and quotient attacks. Journal of Mathematical Cryptology, 2 (2008), 29--61.
(8)R. Gilman, A. D. Miasnikov, A. G. Miasnikov, A. Ushakov, A Report on Generic Complexity. Herald of Omsk State University. Special issue. OmSU, 2007.
(7)A. D. Miasnikov, A. Ushakov, Length Based Attack and Braid Groups: Cryptanalysis of Anshel-Anshel-Godlfeld Key Exchange Protocol, PKC 2007, LNCS 4450, 2007, 76--88.
(6)M. Kreuzer, A. G. Miasnikov, G. Rosenberger, A. Ushakov, Quotient Tests and Grobner Bases, Contemporary Mathematics entitled ``Combinatorial Group Theory, Discrete Groups, and Number Theory'' edited by Fine, Gaglione, and Spellman, 421 (2006), 187-200.
(5)V. Shpilrain, A. Ushakov, A New Key Exchange Protocol Based on the Decomposition Problem, Contemporary Mathematics, 418 (2006), 161--167.
(4)V. Shpilrain, A. Ushakov, The Conjugacy search problem in public key cryptography: unnecessary and insufficient, Applicable Algebra in Engineering, Communication and Computing 17 (2006), 285--289.
(3)A. G. Miasnikov, V. Shpilrain, A. Ushakov, Random subgroups of braid groups: cryptanalysis of a braid group based cryptographic protocol, PKC 2006, LNCS 3958 (2006), 302--314.
(2)A. G. Miasnikov, V. Shpilrain, A. Ushakov, A Practical Attack on a Braid Group Based Cryptographic Protocol, Advances in Cryptology - Crypto 2005, LNCS 3621 (2005), 86--96.
(1)V. Shpilrain, A. Ushakov, Thompson's Group and Public Key Cryptography, in Applied Cryptography and Network Security, LNCS 3531 (2005), 151--164.