Algorithmic problems of group theory, their complexity, and applications to cryptography : AMS Special Sessions Algorithmic Problems of Group Theory and Their Complexity, January 9-10, 2013, San Diego, California : Algorithmic Problems of Group Theory and Applications to Information Security, April 6-7, 2013, Boston College, Chestnut Hill, Massachusetts
Author(s)
Bibliographic Information
Algorithmic problems of group theory, their complexity, and applications to cryptography : AMS Special Sessions Algorithmic Problems of Group Theory and Their Complexity, January 9-10, 2013, San Diego, California : Algorithmic Problems of Group Theory and Applications to Information Security, April 6-7, 2013, Boston College, Chestnut Hill, Massachusetts
(Contemporary mathematics, 633)
American Mathematical Society, c2015
Available at 25 libraries
  Aomori
  Iwate
  Miyagi
  Akita
  Yamagata
  Fukushima
  Ibaraki
  Tochigi
  Gunma
  Saitama
  Chiba
  Tokyo
  Kanagawa
  Niigata
  Toyama
  Ishikawa
  Fukui
  Yamanashi
  Nagano
  Gifu
  Shizuoka
  Aichi
  Mie
  Shiga
  Kyoto
  Osaka
  Hyogo
  Nara
  Wakayama
  Tottori
  Shimane
  Okayama
  Hiroshima
  Yamaguchi
  Tokushima
  Kagawa
  Ehime
  Kochi
  Fukuoka
  Saga
  Nagasaki
  Kumamoto
  Oita
  Miyazaki
  Kagoshima
  Okinawa
  Korea
  China
  Thailand
  United Kingdom
  Germany
  Switzerland
  France
  Belgium
  Netherlands
  Sweden
  Norway
  United States of America
-
Library, Research Institute for Mathematical Sciences, Kyoto University数研
S||CONM||633200032369541
Note
Includes bibliographical references
Description and Table of Contents
Description
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.
Table of Contents
Secret sharing using non-commutative groups and the shortlex order by B. Cavallo and D. Kahrobaei
An algorithm that decides conjugacy in a certain generalized free product by A. E. Clement
Classification of automorphic conjugacy classes in the free group on two generators by B. Cooper and E. Rowland
On elementary free groups by B. Fine, A. Gaglione, G. Rosenberger, and D. Spellman
An application of a localized version of an axiom of Ian Chiswell by A. M. Gaglione, S. Lipschutz, and D. Spellman
A note on Stallings' pregroups by A. M. Gaglione, S. Lipschutz, and D. Spellman
A CCA secure cryptosystem using matrices over group rings by D. Kahrobaei, C. Koupparis, and V. Shpilrain
The MOR cryptosystem and finite $p$-groups by A. Mahalanobis
A group theoretical ElGamal cryptosystem based on a semidirect product of groups and a proposal for a signature protocol by A. I. S. Moldenhauer
On some algorithmic properties of finite state automorphisms of rooted trees by B. Steinberg
by "Nielsen BookData"