Michael Anshel

Professor Emeritus

Main Affiliation

Computer Science


Off Campus




(212) 650-5768

Michael Anshel


Dr. Anshel has instructed at the City College of New York (CUNY) since 1968. He has been a member of the Doctoral Faculty since 1973, teaching in the Engineering, Computer Science and Mathematics programs.He has mentored over thirty doctoral dissertations and is currently mentoring several doctoral students. Prior to accepting his position at CUNY, Dr. Anshel served at the Polytechnic Institute of New York 1966-67 and the University of Arizona 1967-68. He has also lectured at the Mt. Sinai School of Medicine 1975-1980. Dr. Anshel received his BA,MS and PhD respectively from Adelphi University in 1963,1965,1967 and assisted from time to time in the National Science Foundation Summer Institute for High School Teachers at Adelphi University, 1963-1969. Over the course of his career, Dr. Anshel has received numerous fellowships and honors, including the CUNY Faculty Fellowship Award 1985, a NASA-ASEE Faculty Fellowship 1982,1983, a National Science Foundation Fellowship 1963-1966. He has consulted with several corporations including AT&T Bell Laboratories 1986-1987, Delphic Associates 1983, Mathematica 1968, and Lambda Corp 1968 where he worked with the late Hugh Everett III a pioneer in both quantum theory,game theory and discrete optimization. Dr. Michael Anshel is one of the founders of Arithmetica and a member of its Board of Directors. Dr. Anshel is co-inventor for three patents in cryptography and has published numerous articles in Mathematics and Cryptography.Dr. Anshel is a member of the AMS,MAA,ACM,IEEE,IACR. He received a Bachelor of Arts degree magna cum laude, Master of Science degree and a Ph.D. in Mathematics from Adelphi University in Garden City, New York. Website  


  • PhD, Mathematics, Adelphi University, 1967.
  • MS, Mathematics, Adelphi University, 1965.
  • BA, Mathematics, Adelphi University, 1963.

Research Interests

Computational Methods in Algebra, Combinatorics, and Number Theory; Cryptology and Computer Security; Quantum Computing; History of Computing; Bioinformatics.


  • Partitions, Egyptian fractions, and free products of finite abelian groups. Proc. Am. Math. Soc. 111, No.4, 889-899 (1991). (with D.Goldfeld)
  • From the Post-Markov theorem through decision problems to public-key cryptography. Am. Math. Mon. 100, No.9, 835-844 (1993). (with I.Anshel)
  • Zeta functions, one-way functions, and pseudorandom number generators. Duke Math. J. 88, No.2, 371-390 (1997). (with D.Goldfeld)
  • An algebraic method for public-key cryptography. Math. Res. Lett. 6, No.3-4, 287-291 (1999). (with I.Anshel,D.Goldfeld)
  • New Key Agreement Protocols in Braid Group Cryptography. in D.Naccache (ed), Topics in Cryptology- CT-RSA 2001, LNCS 2020 Springer-Verlag (2001) pp. 13-27 (with I.Anshel,B.Fisher,D.Goldfeld)
  • A Fast Lattice-based Polynomial Digital Signature System for M-commerce Proceedings of SPIE (2003) pp. 52-56 (with Xinzhou Wei, Lin Leung)
  • Non-Abelian Key Agreement Protocols Discrete Applied Mathematics, Article 3129, to appear in hardcopy in 2003 (with I. Anshel, and D. Goldfeld)
  • A Group Theoretic Approach to Public-Key Cryptography in DIMACS Series in Mathematics and Theoretical Computer Science Volume 64, pp. 17-23. American Mathematical Society (2004) (with I.Anshel, B.Fisher, D.Goldfeld)

Additional Information

Current Professional Affiliations

AMS, MAA, ACM, IEEE, IACR Arithmetica, member, Board of Directors