044 209 91 25 079 869 90 44
Notepad
The notepad is empty.
The basket is empty.
Free shipping possible
Free shipping possible
Please wait - the print view of the page is being prepared.
The print dialogue opens as soon as the page has been completely loaded.
If the print preview is incomplete, please close it and select "Print again".

Discrete Algebraic Methods

Arithmetic, Cryptography, Automata and Groups, De Gruyter Textbook
BookPaperback
Ranking16667inMathematik
CHF51.90

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



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
More descriptions

Details

ISBN/GTIN978-3-11-041332-8
Product TypeBook
BindingPaperback
PublisherGruyter
Publishing date15/05/2016
Edition1. Auflage
LanguageEnglish
Article no.23597795
CatalogsAVA
Data source no.11345373
Product groupMathematik
More details

Author