Discrete Algebraic Methods - Arithmetic, Cryptography, Automata and Groups (Paperback, Digital original)

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

R1,224
List Price R1,543
Save R319 21%

Or split into 4x interest-free payments of 25% on orders over R50
Learn more

Discovery Miles12240
Mobicred@R115pm x 12* Mobicred Info
Free Delivery
Delivery AdviceShips in 10 - 15 working days



Product 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

Customer Reviews

No reviews or ratings yet - be the first to create one!

Product Details

General

Imprint

De Gruyter

Country of origin

Germany

Series

De Gruyter Textbook

Release date

May 2016

Availability

Expected to ship within 10 - 15 working days

First published

2016

Authors

, , ,

Dimensions

240 x 170mm (L x W)

Format

Paperback - Paperback (DE)

Pages

354

Edition

Digital original

ISBN-13

978-3-11-041332-8

Barcode

9783110413328

Categories

LSN

3-11-041332-9



Trending On Loot