Discrete algebraic methods : arithmetic, cryptography, automata, and groups /

Discrete algebraic methods : arithmetic, cryptography, automata, and groups /

Show other versions (4)

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...

Full description

Saved in:
Bibliographic Details
Main Authors: Diekert, Volker (Author, http://id.loc.gov/vocabulary/relators/aut), Diekert, Volker, 1955- (Author), Hertrampf, Ulrich (http://id.loc.gov/vocabulary/relators/aut), Kufleitner, Manfred (http://id.loc.gov/vocabulary/relators/aut), Rosenberger, Gerhard (http://id.loc.gov/vocabulary/relators/aut)
Corporate Authors: De Gruyter, ebrary, Inc
Format: Book
Language:English
Published: Berlin ; Boston : De Gruyter, [2016]
Berlin, Germany ; Boston, Massachusetts : 2016
Series:De Gruyter Textbook
Subjects:
Algebra > Textbooks
Algorithms > Textbooks
Computer science > Mathematics > Textbooks
Computer science > Textbooks > Mathematics
Cryptography > Textbooks
Ordered algebraic structures > Textbooks
Arithmetik
Automaten
Diskrete algebraische Strukturen
Gruppen
Kryptographie
MATHEMATICS / Discrete Mathematics
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 structuresCryptographyNumber theoretic algorithmsPolynomial time primality testElliptic curvesCombinatorics on wordsAutomataDiscrete infinite groups
Physical Description:1 online resource (342 pages)
1 online resource (354 pages) : illustrations
Format:Mode of access: Internet via World Wide Web
Bibliography:Includes bibliographical references and index
ISBN:9783110413335 (e-book)
9783110413335
Access:Access restricted by licensing agreement
Restricted for use by site license.

Similar Items