0 Item

Number-theoretic Algorithms in Cryptography

By: O.N. Vasilenko

Write A Review

Hardcover | 30 December 2006

At a Glance

Hardcover
243 Pages

Dimensions(cm)
25.4 x 17.78 x 1.91

Hardcover

$452.50

or 4 interest-free payments of $113.13 with

Aims to ship in 15 to 25 business days

When will this arrive by?
Enter delivery postcode to estimate

Algorithmic number theory is a rapidly developing branch of number theory, which, in addition to its mathematical importance, has substantial applications in computer science and cryptography. Among the algorithms used in cryptography, the following are especially important: algorithms for primality testing; factorization algorithms for integers and for polynomials in one variable; applications of the theory of elliptic curves; algorithms for computation of discrete logarithms; algorithms for solving linear equations over finite fields; algorithms for performing arithmetic operations on large integers. The book describes the current state of these and some other algorithms. It also contains extensive bibliography. For this English translation, additional references were prepared and commented on by the author.

Shipping

	Standard Shipping	Express Shipping
Metro postcodes:	$9.99	$14.95
Regional postcodes:	$9.99	$14.95
Rural postcodes:	$9.99	$14.95

How to return your order

At Booktopia, we offer hassle-free returns in accordance with our returns policy. If you wish to return an item, please get in touch with Booktopia Customer Care.

Additional postage charges may be applicable.