Skip to content
Welcome To Our Store.
100,000+ Products for Home, Medical, Office & Classroom Needs
Search
Skip to product information
1 of 1

Discrete Algebraic Methods: Arithmetic, Cryptography, Automata and Groups - Paperback

$72.34
$72.34
Sale Sold out
Shipping calculated at checkout.
In stock (100 units), ready to be shipped

Available Offers

Fastest Delivery Tomorrow With Vip DealOrder within 1 hr 8 mins.

Instant 10% Discount On HDFC Banks Credit/Debit Cards EMI and CreditCard

Secure checkout with
  • American Express
  • Apple Pay
  • Diners Club
  • Discover
  • Google Pay
  • Mastercard
  • PayPal
  • Shop Pay
  • Visa

Flight Range: Up to 1,000 meters (3,280 feet)

Maximum Speed: 45 kilometers per hour (28 miles per hour)

For all orders exceeding a value of 100USD shipping is offered for free.

Returns will be accepted for up to 10 days of Customer’s receipt or tracking number on unworn items. You, as a Customer, are obliged to inform us via email before you return the item.

Otherwise, standard shipping charges apply. Check out our delivery Terms & Conditions for more details.

View Product Details
Shopping cart
Product Product subtotal Quantity Price Product subtotal
Discrete Algebraic Methods: Arithmetic, Cryptography, Automata and Groups - Paperback
Discrete Algebraic Methods: Arithmetic, Cryptography, Automata and Groups - Paperback
Discrete Algebraic Methods: Arithmetic, Cryptography, Automata and Groups - Paperback
$72.34/ea
$0.00
$72.34/ea $0.00

Product Description

by Volker Diekert (Author), Manfred Kufleitner (Author), Gerhard Rosenberger (Author)

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

Author Biography

Volker Diekert, Manfred Kufleitner and Ulrich Hertrampf, Stuttgart, Germany; Gerhard Rosenberger, Hamburg, Germany.

Number of Pages: 354
Dimensions: 0.74 x 9.61 x 6.69 IN
Publication Date: June 18, 2016
you might like