Andere Kunden interessierten sich auch für
![Algebraic Aspects of Cryptography]( "Algebraic Aspects of Cryptography")
Algebraic Aspects of Cryptography132,99 €![An Introduction to Mathematical Cryptography]( "An Introduction to Mathematical Cryptography")
An Introduction to Mathematical Cryptography30,99 €![Elliptische Kurven in der Kryptographie]( "Elliptische Kurven in der Kryptographie")
Elliptische Kurven in der Kryptographie25,99 €![Post-Quantum Cryptography]( "Post-Quantum Cryptography")
Post-Quantum Cryptography110,99 €![The Mathematics of Ciphers]( "The Mathematics of Ciphers")
The Mathematics of Ciphers247,99 €![Poset Codes: Partial Orders, Metrics and Coding Theory]( "Poset Codes: Partial Orders, Metrics and Coding Theory")
Poset Codes: Partial Orders, Metrics and Coding Theory37,99 €![Cryptology and Error Correction]( "Cryptology and Error Correction")
Cryptology and Error Correction41,99 €
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.
Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.
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.
Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.
From the reviews:
"The book at hand has the aim to introduce the reader into the rich world of group-based asymmetric encryption. ... The basics necessary for the understanding are given in introducing chapters. Many hints for further reading are given. So, the book might be useful for the beginner, who wants to get a clear introduction, as well as for the expert, who gets an elaborate survey as well as much stimulation for proceeding research." (Michael Wüstner, Zentralblatt MATH, Vol. 1248, 2012)
"The book at hand has the aim to introduce the reader into the rich world of group-based asymmetric encryption. ... The basics necessary for the understanding are given in introducing chapters. Many hints for further reading are given. So, the book might be useful for the beginner, who wants to get a clear introduction, as well as for the expert, who gets an elaborate survey as well as much stimulation for proceeding research." (Michael Wüstner, Zentralblatt MATH, Vol. 1248, 2012)