Algorithmic Problems of Group Theory, Their Complexity, and Applications to Cryptography

Häftad, Engelska, 2015

Av Delaram Kahrobaei, Vladimir Shpilrain

1 929 kr

Tillfälligt slut

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.

Produktinformation

Utgivningsdatum2015-03-01
Mått178 x 254 x undefined mm
Vikt208 g
FormatHäftad
SpråkEngelska
SerieContemporary Mathematics
FörlagAmerican Mathematical Society
ISBN9780821898598

Tillhör följande kategorier

Tillämpad matematik inom Naturvetenskap och teknik
Algebra inom Naturvetenskap och teknik
Matematik inom Naturvetenskap och teknik

Secret sharing using non-commutative groups and the shortlex order by B. Cavallo and D. KahrobaeiAn algorithm that decides conjugacy in a certain generalized free product by A. E. ClementClassification of automorphic conjugacy classes in the free group on two generators by B. Cooper and E. RowlandOn elementary free groups by B. Fine, A. Gaglione, G. Rosenberger, and D. SpellmanAn application of a localized version of an axiom of Ian Chiswell by A. M. Gaglione, S. Lipschutz, and D. SpellmanA note on Stallings' pregroups by A. M. Gaglione, S. Lipschutz, and D. SpellmanA CCA secure cryptosystem using matrices over group rings by D. Kahrobaei, C. Koupparis, and V. ShpilrainThe MOR cryptosystem and finite $p$-groups by A. MahalanobisA group theoretical ElGamal cryptosystem based on a semidirect product of groups and a proposal for a signature protocol by A. I. S. MoldenhauerOn some algorithmic properties of finite state automorphisms of rooted trees by B. Steinberg