null
Loading... Please wait...
FREE SHIPPING on All Unbranded Items LEARN MORE
Print This Page

Discrete Algebraic Methods (Arithmetic, Cryptography, Automata and Groups)

List Price: $66.99
SKU:
9783110413328
Quantity:
Minimum Purchase
25 unit(s)
  • Availability: Confirm prior to ordering
  • Branding: minimum 50 pieces (add’l costs below)
  • Check Freight Rates (branded products only)

Branding Options (v), Availability & Lead Times

  • 1-Color Imprint: $2.00 ea.
  • Promo-Page Insert: $2.50 ea. (full-color printed, single-sided page)
  • Belly-Band Wrap: $2.50 ea. (full-color printed)
  • Set-Up Charge: $45 per decoration
FULL DETAILS
  • Availability: Product availability changes daily, so please confirm your quantity is available prior to placing an order.
  • Branded Products: allow 10 business days from proof approval for production. Branding options may be limited or unavailable based on product design or cover artwork.
  • Unbranded Products: allow 3-5 business days for shipping. All Unbranded items receive FREE ground shipping in the US. Inquire for international shipping.
  • RETURNS/CANCELLATIONS: All orders, branded or unbranded, are NON-CANCELLABLE and NON-RETURNABLE once a purchase order has been received.
  • Product Details

    Author:
    Volker Diekert, Manfred Kufleitner, Gerhard Rosenberger, Ulrich Hertrampf
    Format:
    Paperback
    Pages:
    354
    Publisher:
    De Gruyter (May 24, 2016)
    Language:
    English
    Audience:
    College/higher education
    ISBN-13:
    9783110413328
    ISBN-10:
    3110413329
    Weight:
    20oz
    Dimensions:
    6.69" x 9.45"
    File:
    TWO RIVERS-PERSEUS-Metadata_Only_Perseus_Distribution_Customer_Group_Metadata_20260510163322-20260511.xml
    Folder:
    TWO RIVERS
    List Price:
    $66.99
    Country of Origin:
    Germany
    Series:
    De Gruyter Textbook
    As low as:
    $57.61
    Publisher Identifier:
    P-PER
    Discount Code:
    C
    Pub Discount:
    60
    Imprint:
    De Gruyter
  • Overview

    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