AMS Bookstore LOGO amslogo
Return to List  Item: 1 of 1   
Number-Theoretic Algorithms in Cryptography
O. N. Vasilenko, Moscow State University, Russia

Translations of Mathematical Monographs
2007; 243 pp; hardcover
Volume: 232
ISBN-10: 0-8218-4090-8
ISBN-13: 978-0-8218-4090-0
List Price: US$97
Member Price: US$77.60
Order Code: MMONO/232
[Add Item]

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.


Graduate students and research mathematicians interested in algorithmic number theory and its applications.

Powered by MathJax
Return to List  Item: 1 of 1   

  AMS Home | Comments:
© Copyright 2014, American Mathematical Society
Privacy Statement

AMS Social

AMS and Social Media LinkedIn Facebook Podcasts Twitter YouTube RSS Feeds Blogs Wikipedia