Download Free Algorithmic Problems Of Group Theory Their Complexity And Applications To Cryptography Book in PDF and EPUB Free Download. You can read online Algorithmic Problems Of Group Theory Their Complexity And Applications To Cryptography and write the review.

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.
Detailed Description
Covering relations between three different areas of mathematics and theoretical computer science, this book explores how non-commutative (infinite) groups, which are typically studied in combinatorial group theory, can be used in public key cryptography.
Group theory appears to be a promising source of hard computational problems for deploying new cryptographic constructions. This reference focuses on the specifics of using groups, including in particular non-Abelian groups, in the field of cryptography. It provides an introduction to cryptography with emphasis on the group theoretic perspective, making it one of the first books to use this approach. The authors provide the needed cryptographic and group theoretic concepts, full proofs of essential theorems, and formal security evaluations of the cryptographic schemes presented. They also provide references for further reading and exercises at the end of each chapter.
This book is intended as a comprehensive treatment of group-based cryptography accessible to both mathematicians and computer scientists, with emphasis on the most recent developments in the area. To make it accessible to a broad range of readers, the authors started with a treatment of elementary topics in group theory, combinatorics, and complexity theory, as well as providing an overview of classical public-key cryptography. Then some algorithmic problems arising in group theory are presented, and cryptosystems based on these problems and their respective cryptanalyses are described. The book also provides an introduction to ideas in quantum cryptanalysis, especially with respect to the goal of post-quantum group-based cryptography as a candidate for quantum-resistant cryptography. The final part of the book provides a description of various classes of groups and their suitability as platforms for group-based cryptography. The book is a monograph addressed to graduate students and researchers in both mathematics and computer science.
Detailed Description
Examines the relationship between three different areas of mathematics and theoretical computer science: combinatorial group theory, cryptography, and complexity theory. It explores how non-commutative (infinite) groups can be used in public key cryptography. It also shows that there is remarkable feedback from cryptography to combinatorial group theory because some of the problems motivated by cryptography appear to be new to group theory.
This book constitutes the refereed proceedings of the 11th Latin American Symposium on Theoretical Informatics, LATIN 2014, held in Montevideo, Uruguay, in March/April 2014. The 65 papers presented together with 5 abstracts were carefully reviewed and selected from 192 submissions. The papers address a variety of topics in theoretical computer science with a certain focus on complexity, computational geometry, graph drawing, automata, computability, algorithms on graphs, algorithms, random structures, complexity on graphs, analytic combinatorics, analytic and enumerative combinatorics, approximation algorithms, analysis of algorithms, computational algebra, applications to bioinformatics, budget problems and algorithms and data structures.
New and classical results in computational complexity, including interactive proofs, PCP, derandomization, and quantum computation. Ideal for graduate students.