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.Assume A12 = G1 O G2 is proper in each of G1 and G2, A2.3 = G2 O G3 is proper in each of G2 and G3 and, moreover, that G1 OG3 = A12 O A2, 3 is proper in each of A12 and A2, 3. Then the pree P corresponding to (G, T) is not a pregroup.
|Title||:||Algorithmic Problems of Group Theory, Their Complexity, and Applications to Cryptography|
|Author||:||Delaram Kahrobaei, Vladimir Shpilrain|
|Publisher||:||American Mathematical Soc. - 2015-02-25|