Get Free Shipping on orders over $89
Discrete Algebraic Methods : Arithmetic, Cryptography, Automata and Groups - Gerhard Rosenberger

Discrete Algebraic Methods

Arithmetic, Cryptography, Automata and Groups

By: Gerhard Rosenberger, Volker Diekert, Ulrich Hertrampf, Manfred Kufleitner

Paperback | 24 May 2016

At a Glance

Paperback


$68.55

or 4 interest-free payments of $17.14 with

 or 

Ships in 5 to 7 business days

The idea behind this book is to provide the mathematical foundations for assessing modern developments in the Information Age. It deepens and complements the basic concepts, but it also considers instructive and more advanced topics. The treatise starts with a general chapter on algebraic structures; this part provides all the necessary knowledge for the rest of the book. The next chapter gives a concise overview of cryptography. Chapter 3 on number theoretic algorithms is important for developping cryptosystems, Chapter 4 presents the deterministic primality test of Agrawal, Kayal, and Saxena. The account to elliptic curves again focuses on cryptographic applications and algorithms. With combinatorics on words and automata theory, the reader is introduced to two areas of theoretical computer science where semigroups play a fundamental role.The last chapter is devoted to combinatorial group theory and its connections to automata.

Contents:
Algebraic structures
Cryptography
Number theoretic algorithms
Polynomial time primality test
Elliptic curves
Combinatorics on words
Automata
Discrete infinite groups

The idea behind this book is to provide the mathematical foundations for assessing modern developments in the Information Age. It deepens and complements the basic concepts, but it also considers instructive and more advanced topics. The treatise starts with a general chapter on algebraic structures; this part provides all the necessary knowledge for the rest of the book. The next chapter gives a concise overview of cryptography. Chapter 3 on number theoretic algorithms is important for developping cryptosystems, Chapter 4 presents the deterministic primality test of Agrawal, Kayal, and Saxena. The account to elliptic curves again focuses on cryptographic applications and algorithms. With combinatorics on words and automata theory, the reader is introduced to two areas of theoretical computer science where semigroups play a fundamental role.The last chapter is devoted to combinatorial group theory and its connections to automata.

Contents:
Algebraic structures
Cryptography
Number theoretic algorithms
Polynomial time primality test
Elliptic curves
Combinatorics on words
Automata
Discrete infinite groups

Industry Reviews
This extremely reader-friendly textbook covers a broad range of practical topics in the intersection of abstract algebra and computer science. [...] Each chapter ends with a well-chosen set of approachable problems, valuable to instructors and students alike. [...] Overall, authors Diekert, Kufleitner, Rosenberger, and Hertrampf have given us an excellent book on a fascinating area of mathematical practice. I warmly recommend it to readers interested in these topics.
James A. Swenson in: MAA November 2017 https: //www.maa.org/press/maa-reviews/discrete-algebraic-methods

More in Discrete Mathematics

Discrete Mathematics with Applications, Metric Edition : 5th edition - Susanna S. Epp
Discrete Mathematics for Computing : Grassroots - Peter Grossman

RRP $150.00

$117.75

21%
OFF
How to Prove It : A Structured Approach - Daniel J. Velleman

RRP $73.95

$70.75

Weakened Ramsey Theory : Discrete Mathematics and Its Applications - Mark R.  Budden
The Math Thought Mindset : Logic, Reasoning, and Proofs - James L. Burk
A Tour through Graph Theory : Textbooks in Mathematics - Karin R. Saoub
A Tour through Graph Theory : Textbooks in Mathematics - Karin R. Saoub
Introduction to Modern Cryptography : Revised Third Edition - Jonathan  Katz
Discrete Mathematics and Its Applications : 2025 Release ISE - Kenneth H. Rosen