Item Successfully Added to Cart
An error was encountered while trying to add the item to the cart. Please try again.
OK
Please make all selections above before adding to cart
OK
Share this page via the icons above, or by copying the link below:
Copy To Clipboard
Successfully Copied!
Algorithmic Problems of Group Theory, Their Complexity, and Applications to Cryptography
 
Edited by: Delaram Kahrobaei :  City University of New York, New York, NY
Vladimir Shpilrain :  City College of New York, New York, NY
Algorithmic Problems of Group Theory, Their Complexity, and Applications to Cryptography
eBook ISBN:  978-1-4704-2263-9
Product Code:  CONM/633.E
List Price: $125.00
MAA Member Price: $112.50
AMS Member Price: $100.00
Add to cart
Algorithmic Problems of Group Theory, Their Complexity, and Applications to Cryptography
Click above image for expanded view
Algorithmic Problems of Group Theory, Their Complexity, and Applications to Cryptography
Edited by: Delaram Kahrobaei :  City University of New York, New York, NY
Vladimir Shpilrain :  City College of New York, New York, NY
eBook ISBN:  978-1-4704-2263-9
Product Code:  CONM/633.E
List Price: $125.00
MAA Member Price: $112.50
AMS Member Price: $100.00
Add to cart
  • Book Details
     
     
    Contemporary Mathematics
    Volume: 633; 2015; 123 pp
    MSC: Primary 20; 68

    This volume contains the proceedings of the AMS Special Session on Algorithmic Problems of Group Theory and Their Complexity, held January 9–10, 2013 in San Diego, CA and the AMS Special Session on Algorithmic Problems of Group Theory and Applications to Information Security, held April 6–7, 2013 at Boston College, Chestnut Hill, MA.

    Over the past few years the field of group-based cryptography has attracted attention from both group theorists and cryptographers. The new techniques inspired by algorithmic problems in non-commutative group theory and their complexity have offered promising ideas for developing new cryptographic protocols. The papers in this volume cover algorithmic group theory and applications to cryptography.

    Readership

    Graduate students and research mathematicians interested in group theory and crytography.
  • Table of Contents
     
     
    • Articles
    • Bren Cavallo and Delaram Kahrobaei — Secret sharing using non-commutative groups and the shortlex order
    • Anthony E. Clement — An algorithm that decides conjugacy in a certain generalized free product
    • Bobbe Cooper and Eric Rowland — Classification of automorphic conjugacy classes in the free group on two generators
    • Benjamin Fine, Anthony Gaglione, Gerhard Rosenberger and Dennis Spellman — On elementary free groups
    • Anthony M. Gaglione, Seymour Lipschutz and Dennis Spellman — An application of a localized version of an axiom of Ian Chiswell
    • Anthony M. Gaglione, Seymour Lipschutz and Dennis Spellman — A note on Stallings’ pregroups
    • Delaram Kahrobaei, Charalambos Koupparis and Vladimir Shpilrain — A CCA secure cryptosystem using matrices over group rings
    • Ayan Mahalanobis — The MOR cryptosystem and finite $p$-groups
    • Anja I. S. Moldenhauer — A group theoretical ElGamal cryptosystem based on a semidirect product of groups and a proposal for a signature protocol
    • Benjamin Steinberg — On some algorithmic properties of finite state automorphisms of rooted trees
  • Additional Material
     
     
  • Requests
     
     
    Review Copy – for publishers of book reviews
    Permission – for use of book, eBook, or Journal content
    Accessibility – to request an alternate format of an AMS title
Contemporary Mathematics
Volume: 633; 2015; 123 pp
MSC: Primary 20; 68

This volume contains the proceedings of the AMS Special Session on Algorithmic Problems of Group Theory and Their Complexity, held January 9–10, 2013 in San Diego, CA and the AMS Special Session on Algorithmic Problems of Group Theory and Applications to Information Security, held April 6–7, 2013 at Boston College, Chestnut Hill, MA.

Over the past few years the field of group-based cryptography has attracted attention from both group theorists and cryptographers. The new techniques inspired by algorithmic problems in non-commutative group theory and their complexity have offered promising ideas for developing new cryptographic protocols. The papers in this volume cover algorithmic group theory and applications to cryptography.

Readership

Graduate students and research mathematicians interested in group theory and crytography.
  • Articles
  • Bren Cavallo and Delaram Kahrobaei — Secret sharing using non-commutative groups and the shortlex order
  • Anthony E. Clement — An algorithm that decides conjugacy in a certain generalized free product
  • Bobbe Cooper and Eric Rowland — Classification of automorphic conjugacy classes in the free group on two generators
  • Benjamin Fine, Anthony Gaglione, Gerhard Rosenberger and Dennis Spellman — On elementary free groups
  • Anthony M. Gaglione, Seymour Lipschutz and Dennis Spellman — An application of a localized version of an axiom of Ian Chiswell
  • Anthony M. Gaglione, Seymour Lipschutz and Dennis Spellman — A note on Stallings’ pregroups
  • Delaram Kahrobaei, Charalambos Koupparis and Vladimir Shpilrain — A CCA secure cryptosystem using matrices over group rings
  • Ayan Mahalanobis — The MOR cryptosystem and finite $p$-groups
  • Anja I. S. Moldenhauer — A group theoretical ElGamal cryptosystem based on a semidirect product of groups and a proposal for a signature protocol
  • Benjamin Steinberg — On some algorithmic properties of finite state automorphisms of rooted trees
Review Copy – for publishers of book reviews
Permission – for use of book, eBook, or Journal content
Accessibility – to request an alternate format of an AMS title
Powered by MathJax
Please select which format for which you are requesting permissions.