Ebook Share

Publisher: Birkhuser Basel
Language: English
ISBN: 3764388269
Paperback: 183 pages
Data: Aug 2008
Format: PDF
Description: This book is about relations between three different areas of mathematics and theoretical computer science: combinatorial group theory, cryptography, and complexity theory. It is explored how non-commutative (infinite) groups, which are typically studied in combinatorial group theory, can be used in public key cryptography. It is also shown that there is a 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.

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.

Its elementary exposition makes the book accessible to graduate as well as undergraduate students in mathematics or computer science.

RapidShare Click the link above to download from RapidShare http://rapidshare.com/	iFile.it Click the link above to download from iFile.it http://iFile.it/

Please leave message if the download links are dead.
We will update them ASAP!

Related Books

Identity-Based Cryptography - Volume 2 Cryptology and Information Security Series

Complexity and Cryptography: An Introduction

Post-Quantum Cryptography

Finite Automata and Application to Cryptography

An Introduction to Mathematical Cryptography

A Classical Introduction to Cryptography Exercise Book

Beginning Cryptography with Java

Elliptic Curves: Number Theory and Cryptography, Second Edition

Hardware-based Computer Security Techniques to Defeat Hackers: From Biometrics to Quantum Cryptography

Computer Security and Cryptography