Non-commutative Cryptography and Complexity of Group-theoretic Problems de Alexei Myasnikov; Vladimir Shpilrain; Alexander Ushakov: New Hardback (2011)

Descripci�n

This book is about relations between three different areas of mathematics and theoretical computer science: combinatorial group theory, cryptography, and complexity theory. It explores how non-commutative (infinite) groups, which are typically studied in combinatorial group theory, 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, and they open many interesting research avenues within group theory. In particular, a lot of emphasis in the book is put on studying search problems, as compared to decision problems traditionally studied in combinatorial group theory. Then, complexity theory, notably generic-case complexity of algorithms, is employed for cryptanalysis of various cryptographic protocols based on infinite groups, and the ideas and machinery from the theory of generic-case complexity are used to study asymptotically dominant properties of some infinite groups that have been applied in public key cryptography so far. This book also describes new interesting developments in the algorithmic theory of solvable groups and another spectacular new development related to complexity of group-theoretic problems, which is based on the ideas of compressed words and straight-line programs coming from computer science.

N� de ref. del art�culo LU-9780821853603

Contactar al vendedor

Denunciar este art�culo

Detalles bibliogr�ficos

T�tulo: Non-commutative Cryptography and Complexity of Group-theoretic Problems
Editor: American Mathematical Society
Fecha de publicaci�n: 2011
Idioma: Ingl�s
ISBN 10: 0821853600
ISBN 13: 9780821853603
Encuadernaci�n: Hardback
Estado: New

Acerca de

Sinopsis

This book is about relations between three different areas of mathematics and theoretical computer science: combinatorial group theory, cryptography, and complexity theory. It explores how non-commutative (infinite) groups, which are typically studied in combinatorial group theory, 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, and they open many interesting research avenues within group theory. In particular, a lot of emphasis in the book is put on studying search problems, as compared to decision problems traditionally studied in combinatorial group theory. Then, complexity theory, notably generic-case complexity of algorithms, is employed for cryptanalysis of various cryptographic protocols based on infinite groups, and the ideas and machinery from the theory of generic-case complexity are used to study asymptotically dominant properties of some infinite groups that have been applied in public key cryptography so far. This book also describes new interesting developments in the algorithmic theory of solvable groups and another spectacular new development related to complexity of group-theoretic problems, which is based on the ideas of compressed words and straight-line programs coming from computer science.

Acerca del autor

Charlotte y Peter Fiell son dos autoridades en historia, teor�a y cr�tica del dise�o y han escrito m�s de sesenta libros sobre la materia, muchos de los cuales se han convertido en �xitos de ventas. Tambi�n han impartido conferencias y cursos como profesores invitados, han comisariado exposiciones y asesorado a fabricantes, museos, salas de subastas y grandes coleccionistas privados de todo el mundo. Los Fiell han escrito numerosos libros para TASCHEN, entre los que se incluyen 1000 Chairs, Dise�o del siglo XX, El dise�o industrial de la A a la Z, Scandinavian Design y Dise�o del siglo XXI.

"Sobre este t�tulo" puede pertenecer a otra edici�n de este libro.