- We will send in 10–14 business days.
/images/books/13021712/9783110413328.jpg)
- Author: Volker Diekert
- Publisher: De Gruyter
- Year: 2016
- Pages: 354
- ISBN-10: 3110413329
- ISBN-13: 9783110413328
- Format: 17 x 24.4 x 1.9 cm, minkšti viršeliai
- Language: English
- SAVE -10% with code: EXTRA
Reviews
Description
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
EXTRA 10 % discount with code: EXTRA
The promotion ends in 23d.07:58:57
The discount code is valid when purchasing from 10 €. Discounts do not stack.
- Author: Volker Diekert
- Publisher: De Gruyter
- Year: 2016
- Pages: 354
- ISBN-10: 3110413329
- ISBN-13: 9783110413328
- Format: 17 x 24.4 x 1.9 cm, minkšti viršeliai
- Language: English English
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
Reviews