**A Computational Introduction to Number Theory and Algebra**

by Victor Shoup

**Publisher**: Cambridge University Press 2005**ISBN/ASIN**: 0521851548**ISBN-13**: 9780521851541**Number of pages**: 534

**Description**:

Number theory and algebra play an increasingly significant role in computing and communications, as evidenced by the striking applications of these subjects to such fields as cryptography and coding theory. This introductory book emphasises algorithms and applications, such as cryptography and error correcting codes, and is accessible to a broad audience. The mathematical prerequisites are minimal: nothing beyond material in a typical undergraduate course in calculus is presumed, other than some experience in doing proofs - everything else is developed from scratch.

Download or read it online for free here:

**Download link**

(3.5MB, PDF)

## Similar books

**Axiom: The Scientific Computation System**

by

**Richard D. Jenks, Robert S. Sutor**-

**axiom-developer.org**

Axiom is a free general purpose computer algebra system. The book gives a technical introduction to AXIOM, interacts with the system's tutorial, accesses algorithms developed by the symbolic computation community, and presents advanced techniques.

(

**15892**views)

**Computer Algebra, Algorithms, Systems and Applications**

by

**Richard Liska, at al.**-

**Czech Technical University**

From the table of contents: Introduction; Algorithms for algebraic computation; Integrated mathematical systems; Basic possibilities of integrated mathematical systems; Applications of computer algebra; Another sources of study.

(

**12651**views)

**Algorithmic Mathematics**

by

**Leonard Soicher, Franco Vivaldi**-

**Queen Mary University of London**

This text is a course in mathematical algorithms, intended for second year mathematics students. It introduces the algorithms for computing with integers, polynomials and vector spaces. The course requires no computing experience.

(

**17273**views)

**An Architecture for Combinator Graph Reduction**

by

**Philip J. Koopman, Jr.**-

**Academic Press**

The results of cache-simulation experiments with an abstract machine for reducing combinator graphs are presented. The abstract machine, called TIGRE, exhibits reduction rates that compare favorably with previously reported techniques.

(

**12033**views)