Stevens Professors Coauthor New Book on Non-Commutative Cryptography

11/28/2011

Hoboken, NJ – Stevens professors Alexei Miasnikov and Alexander Ushakov from the Department of Mathematical Sciences in the Schaefer School of Engineering & Science are coauthors of a new book entitled, "Non-Commutative Cryptography and Complexity of Group-Theoretic Problems" (American Mathematical Society, December 2011).

The book explores “non-commutative ideas” in cryptography that have appeared in literature over the last decade or so. Since the authors have backgrounds in combinatorial and computational group theory, they pay particular attention to group-based cryptography i.e., cryptography that uses non-commutative group theory. They also discuss ideas from other areas of mathematics, including the problem of authentication, one of the most important areas of applications of modern cryptography.

In the book, the coauthors note that there is remarkable feedback from cryptography to combinatorial and computational group theory because some of the problems motivated by cryptography appear to be new to group theory, and they open many interesting research avenues within group theory. Then they employ complexity theory, notably generic-case complexity of algorithms, for cryptanalysis of various cryptographic protocols based on infinite groups. They also use the ideas and machinery from the theory of generic-case complexity to study asymptotically dominant properties of some infinite groups that have been used in public-key cryptography so far. It turns out that for a relevant cryptographic scheme to be secure, it is essential that keys are selected from a very small subset rather than from the whole group. Detecting these subsets (“black holes”) for a particular cryptographic scheme is usually very challenging, but it holds the key to creating secure cryptographic primitives based on non-commutative groups.

Finally, a substantial part of the book deals with new directions in computational group theory itself, notably with search problems motivated by cryptography. The authors also study complexity of more traditional decision problems (like the word and conjugacy problems) in some groups that have been suggested as platforms for cryptographic protocols. 

About Stevens Institute of Technology

Founded in 1870, Stevens Institute of Technology, The Innovation University™, lives at the intersection of industry, academics and research.  The University's students, faculty and partners leverage their collective real-world experience and culture of innovation, research and entrepreneurship to confront global challenges in engineering, science, systems and technology management.

Based in Hoboken, N.J. and with a location in Washington, D.C., Stevens offers baccalaureate, master’s, certificates and doctoral degrees in engineering, the sciences and management, in addition to baccalaureate degrees in business and liberal arts.  Stevens has been recognized by both the US Department of Defense and the Department of Homeland Security as a National Center of Excellence in the areas of systems engineering and port security research. The University has a total enrollment of more than 2,350 undergraduate and 3,600 graduate students with almost 450 faculty. Stevens’ graduate programs have attracted international participation from China, India, Southeast Asia, Europe and Latin America as well as strategic partnerships with industry leaders, governments and other universities around the world.  Additional information may be obtained at www.stevens.edu and www.stevens.edu/news.