Department of Mathematical Sciences Print   
Math Sciences
Seminars
News
Undergraduate Programs
Graduate Programs
Faculty & Staff
Students
Course Websites
Resources
Contact Us
Search

©Copyright 2007
Stevens Institute of Technology

 
        
Alexander Ushakov
Alexander Ushakov
Assistant Professor
School:  Schaefer School of Engineering & Science
Department:  Mathematical Sciences
Program:  Mathematics

Location:219A Kidde
Phone:201.216.8597
Fax:201.216.8321
Email:aushakov@stevens.edu

Research & Education
Research
  • computational group theory
  • generic complexity
  • algebraic cryptography
Achievements & Professional Societies
Grants, Contracts & Funds
  • NSF research award ``Collaborative research: Theoretical and experimental approaches to search problems in group theory''.
  • NSF conference award ``Thematic program semester: Geometric, combinatorial and computational group theory''.
Selected Publications
Journals

  • A. G. Miasnikov, A. Ushakov, and D. Won. (2012). "Power Circuits, Exponential Algebra, and Time Complexity", International Journal of Algebra and Computation, 22 (6), 51.  arxiv  .


  • A. G. Miasnikov, A. Ushakov. (2011). "Random van Kampen diagrams and algorithmic problems in groups", Groups - Complexity - Cryptology, 3 (1), 121–185.


  • N. Mosina and A. Ushakov. (2011). "Strong law of large numbers on graphs and groups", Groups - Complexity - Cryptology, 3 (1), 67-103.  [arxiv]  .


  • A. G. Miasnikov, A. Ushakov, and D. Won. (2011). "The word problem in the Baumslag group with a non-elementary Dehn function is polynomial time decidable", Journal of Algebra, 345 (1), 324–342.  [arxiv]  .


  • A. G. Miasnikov, I. Lysenok and A. Ushakov. (2010). "The conjugacy problem in the Grigorchuk group is polynomial time decidable", Groups-Geometry-Dynamics, 4 (4), 813–833.  [arxiv]  .


  • N. Mosina and A. Ushakov. (2010). "Mean set attack: Cryptanalysis of Sibert et al authentication protocol", Journal of Mathematical Cryptology, 4 (2), 149–174.  [arxiv]  .


  • A. Miasnikov, V. Roman’kov, A. Ushakov and A. Vershik. (2010). "The Word and Geodesic Problems in Free Solvable Groups", Transactions of AMS, 362 4655–4682.  [arxiv]  .


  • J. Longrigg and A. Ushakov. (2009). "A Practical Attack on a Certain Braid Group Based Shifted Conjugacy Authentication Protocol", Groups-Complexity-Cryptology, 1 275–286.


  • J. Longrigg and A. Ushakov. (2008). "Cryptanalysis of shifted conjugacy authentication protocol", Journal of Mathematical Cryptology, 2 (2), 107–114.  [arxiv]  .


  • A. D. Myasnikov and A. Ushakov. (2008). "Cryptanalysis of Anshel-Anshel-Goldfeld-Lemieux key agreement protocol", Groups-Complexity-Cryptology, 1 (1), 63–75.  [arxiv]  .


  • A. G. Miasnikov and A. Ushakov. (2008). "Random subgroups and analysis of the length-based and quotient attacks", Journal of Mathematical Cryptology, 2 (1), 29–61.  [arxiv]  .


  • R. Gilman, A. D. Myasnikov, A. G. Miasnikov and A. Ushakov. (2007). "A Report on Generic Complexity", Herald of Omsk State University,  [arxiv]  .


  • V. Shpilrain, A. Ushakov. (2006). "The Conjugacy search problem in public key cryptography: unnecessary and insufficient", Applicable Algebra in Engineering, Communication and Computing (17), 285--289.  [IACR]  .


    • Conference Proceedings

  • V. Diekert, J. Laun, A. Ushakov. (2012). "Efficient algorithms for highly compressed data: The Word Problem in Higman’s group is in P", STACS-2012. Proceedings of the 29th Symposium on Theoretical Aspects of Computer Science, 218-229.  [arxiv]  .


  • R. Gilman, A. D. Myasnikov, A. G. Miasnikov and A. Ushakov. (2008). "New developments in Commutator Key Exchange", Proceedings of the First International Conference on Symbolic Computation and Cryptography. 146–150.


  • V. Shpilrain and A. Ushakov. (2008). "An authentication scheme based on the twisted conjugacy problem", Applied Cryptography and Network Security (ACNS) 2008. LNCS 5037 366–372.  [arxiv]  .


  • A. D. Miasnikov and A. Ushakov. (2007). "Length Based Attack and Braid Groups: Cryptanalysis of Anshel- Anshel-Godlfeld Key Exchange Protocol", Theory and Practice of Public-Key Cryptography (PKC) 2007. LNCS 4450 76–88.


  • M. Kreuzer, A. G. Miasnikov, G. Rosenberger and A. Ushakov. (2006). "Quotient Tests and Grobner Bases", Combinatorial Group Theory, Discrete Groups and Number Theory. 187-200.  [link]  .


  • V. Shpilrain and A. Ushakov. (2006). "A New Key Exchange Protocol Based on the Decomposition Problem", International Workshop on Algebraic Methods in Cryptography. 161–167.  [arxiv]  .


  • A. Miasnikov, V. Shpilrain, and A. Ushakov. (2006). "Random subgroups of braid groups: cryptanalysis of a braid group based cryptographic protocol", Theory and Practice of Public-Key Cryptography (PKC) 2006. LNCS 3958 302-314.  [IACR]  .


  • A. Miasnikov, V. Shpilrain, and A. Ushakov. (2005). "A Practical Attack on a Braid Group Based Cryptographic Protocol", Crypto 2005. LNCS 3621 86–96.  [IACR]  .


  • V. Shpilrain and A. Ushakov. (2005). "Thompson's Group and Public Key Cryptography", Applied Cryptography and Network Security (ACNS) 2005. LNCS 3531 151-164.  [arxiv]  .


    • Books

  • Alexei Myasnikov, Vladimir Shpilrain, Alexander Ushakov. (Dec 2011). Non-Commutative Cryptography and Complexity of Group-Theoretic Problems, American Mathematical Society.


  • Alexei Myasnikov, Vladimir Shpilrain, Alexander Ushakov. (Aug 2008). Group-based Cryptography, Birkhauser Basel.


    •  
    		               
     
     
    Stevens Main Site • Web Campus • College of Arts & Letters • School of Technology Management • School of Systems & Enterprises • SES Webmaster
    Stevens Institute of Technology | 1 Castle Point on Hudson, Hoboken, NJ 07030 | Phone: 201.216.5263 | Fax: 201.216.8909