Description

Book Synopsis
Algorithmic number theory is a branch of number theory, which, in addition to its mathematical importance, has substantial applications in computer science and cryptography. This book describes the various algorithms used in cryptography.

Table of Contents
Primality testing and construction of large primes Factorization of integers with exponential complexity Factorization of integers with subexponential complexity Application of elliptic curves to primality testing and factorization of integers Algorithms for computing discrete logarithm Factorization of polynomials over finite fields Reduced lattice bases and their applications Factorization of polynomials over the field of rational numbers with polynomial complexity Discrete Fourier transform and its applications High-precision integer arithmetic Solving systems of linear equations over finite fields Facts from number theory Bibliography Index.

Numbertheoretic Algorithms in Cryptography

    Product form

    £131.40

    Includes FREE delivery

    RRP £146.00 – you save £14.60 (10%)

    Order before 4pm tomorrow for delivery by Mon 10 Aug 2026.

    A Hardback by American Mathem American Mathem

    1 in stock

      Trusted by thousands of customers. See 2,385+ Customer Reviews

      View other formats and editions of Numbertheoretic Algorithms in Cryptography by American Mathem American Mathem

      Publisher: MP-AMM American Mathematical
      Publication Date: Publication Date: 12/30/2006 12:00:00 AM
      ISBN13: 9780821840900, 978-0821840900
      ISBN10: 0821840908

      Description

      Book Synopsis
      Algorithmic number theory is a branch of number theory, which, in addition to its mathematical importance, has substantial applications in computer science and cryptography. This book describes the various algorithms used in cryptography.

      Table of Contents
      Primality testing and construction of large primes Factorization of integers with exponential complexity Factorization of integers with subexponential complexity Application of elliptic curves to primality testing and factorization of integers Algorithms for computing discrete logarithm Factorization of polynomials over finite fields Reduced lattice bases and their applications Factorization of polynomials over the field of rational numbers with polynomial complexity Discrete Fourier transform and its applications High-precision integer arithmetic Solving systems of linear equations over finite fields Facts from number theory Bibliography Index.

      Recently viewed products

      © 2026 Book Curl

        • American Express
        • Apple Pay
        • Diners Club
        • Discover
        • Google Pay
        • Maestro
        • Mastercard
        • PayPal
        • Shop Pay
        • Union Pay
        • Visa

        Login

        Forgot your password?

        Don't have an account yet?
        Create account