Algorithmic problems of group theory, their complexity, and applications to cryptography /  [electronic resource]  
Delaram Kahrobaei, Vladimir Shpilrain, editors. 
 - 1 online resource (pages cm.) 
 - Contemporary mathematics,   v. 633  0271-4132 (print);   1098-3627 (online);  .
<br/><br/> "AMS Special Session on Algorithmic Problems of Group Theory and Their Complexity, January 9-10, 2013, San Diego, CA."  "AMS Special Session on Algorithmic Problems of Group Theory and Applications to Information Security, April 6-7, 2013, Boston College, Chestnut Hill, MA." 
<br/><br/>Includes bibliographical references. 
<br/><br/> Secret sharing using non-commutative groups and the shortlex order /  An algorithm that decides conjugacy in a certain generalized free product /  Classification of automorphic conjugacy classes in the free group on two generators /  On elementary free groups /  An application of a localized version of an axiom of Ian Chiswell /  A note on Stallings' pregroups /  A CCA secure cryptosystem using matrices over group rings /  The MOR cryptosystem and finite $p$-groups /  A group theoretical ElGamal cryptosystem based on a semidirect product of groups and a proposal for a signature protocol /  On some algorithmic properties of finite state automorphisms of rooted trees /  Bren Cavallo and Delaram Kahrobaei --  Anthony E. Clement --  Bobbe Cooper and Eric Rowland --  Benjamin Fine, Anthony Gaglione, Gerhard Rosenberger and Dennis Spellman --  Anthony M. Gaglione, Seymour Lipschutz and Dennis Spellman --  Anthony M. Gaglione, Seymour Lipschutz and Dennis Spellman --  Delaram Kahrobaei, Charalambos Koupparis and Vladimir Shpilrain --  Ayan Mahalanobis --  Anja I. S. Moldenhauer --  Benjamin Steinberg --  http://www.ams.org/conm/633/  http://dx.doi.org/10.1090/conm/633/12646  http://www.ams.org/conm/633/  http://dx.doi.org/10.1090/conm/633/12647  http://www.ams.org/conm/633/  http://dx.doi.org/10.1090/conm/633/12648  http://www.ams.org/conm/633/  http://dx.doi.org/10.1090/conm/633/12649  http://www.ams.org/conm/633/  http://dx.doi.org/10.1090/conm/633/12650  http://www.ams.org/conm/633/  http://dx.doi.org/10.1090/conm/633/12651  http://www.ams.org/conm/633/  http://dx.doi.org/10.1090/conm/633/12652  http://www.ams.org/conm/633/  http://dx.doi.org/10.1090/conm/633/12653  http://www.ams.org/conm/633/  http://dx.doi.org/10.1090/conm/633/12654  http://www.ams.org/conm/633/  http://dx.doi.org/10.1090/conm/633/12655 
<br/><br/> Access is restricted to licensed institutions 
<br/><br/><br/>Electronic reproduction. <br/>Providence, Rhode Island : <br/>American Mathematical Society. <br/>2012 
<br/><br/><br/>Mode of access : World Wide Web 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Group theory--Congresses.<br/>Noncommutative algebras--Congresses.<br/>Algorithms--Congresses.<br/>Cryptography--Congresses.<br/>Data encryption (Computer science)--Congresses.<br/>Algebra--Congresses.<br/>Group theory and generalizations.<br/>Computer science.
<br/><br/><label>LC Class. No.: </label>QA176  / .A454 2014 
<br/><br/><label>Dewey Class. No.: </label>652/.8015122