AMS Bookstore LOGO amslogo
Return to List  Item: 1 of 1   
Computational and Combinatorial Group Theory and Cryptography
Edited by: Benjamin Fine, Fairfield University, CT, Delaram Kahrobaei, CUNY Graduate Center, New York, NY, and Gerhard Rosenberger, University of Hamburg, Germany
cover
SEARCH THIS BOOK:

Contemporary Mathematics
2012; 199 pp; softcover
Volume: 582
ISBN-10: 0-8218-7563-9
ISBN-13: 978-0-8218-7563-6
List Price: US$74
Member Price: US$59.20
Order Code: CONM/582
[Add Item]

Request Permissions

This volume contains the proceedings of the AMS Special Session on Computational Algebra, Groups, and Applications, held April 30-May 1, 2011, at the University of Nevada, Las Vegas, Nevada, and the AMS Special Session on the Mathematical Aspects of Cryptography and Cyber Security, held September 10-11, 2011, at Cornell University, Ithaca, New York.

Over the past twenty years combinatorial and infinite group theory has been energized by three developments: the emergence of geometric and asymptotic group theory, the development of algebraic geometry over groups leading to the solution of the Tarski problems, and the development of group-based cryptography. These three areas in turn have had an impact on computational algebra and complexity theory.

The papers in this volume, both survey and research, exhibit the tremendous vitality that is at the heart of group theory in the beginning of the twenty-first century as well as the diversity of interests in the field.

Readership

Graduate students and research mathematicians interested in combinatorial and computational group theory and their applications to cryptography.

Powered by MathJax
Return to List  Item: 1 of 1   

  AMS Home | Comments: webmaster@ams.org
© Copyright 2014, American Mathematical Society
Privacy Statement

AMS Social

AMS and Social Media LinkedIn Facebook Podcasts Twitter YouTube RSS Feeds Blogs Wikipedia