Discrete Algebraic Methods

From basic algebraic structures to cryptography, arithmetic with elliptic curves, and automata - this textbook contains a modern introduction to discrete algebraic methods as required by mathematicians and computer scientists in the age of the internet. It lays foundations for theoretical computer science and is suitable for master students with a basic background in mathematics. 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.

שנה

2016

שפה

English

סדרה

De Gruyter Textbook

הוצאה

De Gruyter

מהדורות

1

עמודים

354

ISBN

9783110416329

מקור הנתונים: Wikidata