MARC

LEADER 00000cam a2200000 i 4500
001 EBOOKCENTRAL_ocn961493142
003 OCoLC
005 20240329122006.0
006 m o d
007 cr cn|||||||||
008 160125t20152015riu ob 000 0 eng d
040 |a AZK  |b eng  |e rda  |e pn  |c AZK  |d OCLCO  |d OCLCF  |d OCLCO  |d OCLCA  |d EBLCP  |d DEBSZ  |d MYG  |d IDB  |d LLB  |d UIU  |d E7B  |d YDXCP  |d N$T  |d COO  |d OTZ  |d OCLCQ  |d LEAUB  |d OCLCQ  |d UKAHL  |d K6U  |d OCLCO  |d OCLCQ  |d OCLCO  |d OCLCL 
019 |a 905837936  |a 907355985  |a 908071794  |a 922982008 
020 |a 9781470422639  |q (e-book) 
020 |a 1470422638 
020 |z 9780821898598 
020 |z 0821898590 
029 1 |a AU@  |b 000062344589 
029 1 |a DEBBG  |b BV043623565 
029 1 |a DEBSZ  |b 452553423 
035 |a (OCoLC)961493142  |z (OCoLC)905837936  |z (OCoLC)907355985  |z (OCoLC)908071794  |z (OCoLC)922982008 
050 4 |a QA176  |b .A446 2015eb 
072 7 |a BUS  |x 011000  |2 bisacsh 
082 0 4 |a 652/.8015122  |2 23 
084 |a 20-XX  |a 68-XX  |2 msc 
049 |a UAMI 
245 0 0 |a Algorithmic problems of group theory, their complexity, and applications to cryptography /  |c Delaram Kahrobaei, Vladimir Shpilrain, editors. 
264 1 |a Providence, Rhode Island :  |b American Mathematical Society,  |c 2015. 
264 4 |c ©2015 
300 |a 1 online resource (136 pages) 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a data file 
380 |a Bibliography 
490 1 |a Contemporary Mathematics,  |x 1098-3627 ;  |v 633 
500 |a "AMS Special Session on Algorithmic Problems of Group Theory and Applications to Information Security, April 6-7, 2013, Boston College, Chestnut Hill, MA."--Cover 
500 |a "AMS Special Session on Algorithmic Problems of Group Theory and Their Complexity, January 9-10, 2013, San Diego, CA."--Cover 
504 |a Includes bibliographical references. 
588 0 |a Print version record. 
505 0 |a Cover -- Title page -- Contents -- Preface -- Secret sharing using non-commutative groups and the shortlex order -- 1. Introduction -- 2. Formal Definition -- 3. Shamirâ€?s Secret Sharing Scheme -- 4. Secret Sharing Using Non-commutative Groups -- 5. Updating Relators -- 6. Conclusion -- References -- An algorithm that decides conjugacy in a certain generalized free product -- 1. Introduction -- 2. Preliminaries -- 3. The Algorithm -- References -- Classification of automorphic conjugacy classes in the free group on two generators -- 1. Introduction 
505 8 |a 2. The graph Î?()3. Non-root classes -- 4. Root classes -- 5. Enumeration -- Appendix A. Table of automorphic conjugacy classes -- Appendix B. Number of automorphic conjugacy classes of each type -- Appendix C. Number of paths of each size -- Acknowledgement -- References -- On elementary free groups -- 1. Introduction -- 2. The Tarski Problems and Elementary Free Groups -- 3. Surface Groups and Magnusâ€? Theorem -- 4. Cyclic Centralizers and Commuting Elements -- 5. Hyperbolicity and Stable Hyperbolicity -- 6. The Retract Theorem and Turner Groups 
505 8 |a 7. Conjugacy Separability of Elementary Free Groups8. Tame Automorphisms of Elementary Free Groups -- 9. Faithful Representations in (2,\C) -- References -- An application of a localized version of an axiom of Ian Chiswell -- 1. Introduction -- 2. Questions -- References -- A note on Stallingsâ€? pregroups -- 1. Introduction -- 2. Adds, Prees and Pregroups -- 3. Kushnerâ€?s Generalization of a Pregroup. T2-prees -- 4. Axiom [GLS2] -- 5. Generalizations -- References -- A CCA secure cryptosystem using matrices over group rings 
505 8 |a 1. Cramer-Shoup cryptosystem2. A CCA-2 secure cryptosystem using matrices over group rings -- 3. Adaptive CCA security for matrices over group rings -- References -- The MOR cryptosystem and finite -groups -- 1. Introduction -- 2. Definitions and notations -- 3. The MOR cryptosystem -- 4. MOR cryptosystems on finite -groups using ′-automorphisms -- 5. The MOR cryptosystem and elementary abelian -group -- 6. The extra-special -groups and its automorphism group -- 7. MOR cryptosystems on finite -groups using -automorphisms -- 8. Conclusion 
590 |a ProQuest Ebook Central  |b Ebook Central Academic Complete 
650 0 |a Group theory  |v Congresses. 
650 0 |a Noncommutative algebras  |v Congresses. 
650 0 |a Algorithms  |v Congresses. 
650 0 |a Data encryption (Computer science)  |v Congresses. 
650 0 |a Cryptography  |v Congresses. 
650 0 |a Algebra  |v Congresses. 
650 6 |a Théorie des groupes  |v Congrès. 
650 6 |a Algèbres non commutatives  |v Congrès. 
650 6 |a Algorithmes  |v Congrès. 
650 6 |a Chiffrement (Informatique)  |v Congrès. 
650 6 |a Cryptographie  |v Congrès. 
650 6 |a Algèbre  |v Congrès. 
650 7 |a BUSINESS & ECONOMICS  |x Business Writing.  |2 bisacsh 
650 7 |a Algebra  |2 fast 
650 7 |a Algorithms  |2 fast 
650 7 |a Cryptography  |2 fast 
650 7 |a Data encryption (Computer science)  |2 fast 
650 7 |a Group theory  |2 fast 
650 7 |a Noncommutative algebras  |2 fast 
650 7 |a Group theory and generalizations.  |2 msc 
650 7 |a Computer science.  |2 msc 
655 7 |a Conference papers and proceedings  |2 fast 
700 1 |a Kahrobaei, Delaram,  |d 1975-  |e editor. 
700 1 |a Shpilrain, Vladimir,  |d 1960-  |e editor. 
758 |i has work:  |a Algorithmic problems of group theory, their complexity, and applications to cryptography (Text)  |1 https://id.oclc.org/worldcat/entity/E39PCGQp8kmxVtBdwrpxVvPTXm  |4 https://id.oclc.org/worldcat/ontology/hasWork 
776 0 8 |i Print version:  |t Algorithmic problems of group theory, their complexity, and applications to cryptography.  |d Providence, Rhode Island : American Mathematical Society, ©2015  |h vii, 123 pages  |k Contemporary mathematics (American Mathematical Society) ; 633  |x 1098-3627  |z 9780821898598 
830 0 |a Contemporary mathematics (American Mathematical Society) ;  |v 633. 
856 4 0 |u https://ebookcentral.uam.elogim.com/lib/uam-ebooks/detail.action?docID=3114280  |z Texto completo 
936 |a BATCHLOAD 
938 |a Askews and Holts Library Services  |b ASKH  |n AH37444929 
938 |a EBL - Ebook Library  |b EBLB  |n EBL3114280 
938 |a ebrary  |b EBRY  |n ebr11040284 
938 |a EBSCOhost  |b EBSC  |n 1220362 
938 |a YBP Library Services  |b YANK  |n 12372068 
994 |a 92  |b IZTAP