𝔖 Scriptorium
✦   LIBER   ✦
πŸ“

Number-theoretic Algorithms in Cryptography

✍ Scribed by O. N. Vasilenko

Publisher
American Mathematical Society
Year
2006
Tongue
English
Leaves
262
Series
Translations of Mathematical Monographs 232
Category
Library
⬇  Acquire This Volume

No coin nor oath required. For personal study only.

✦ Synopsis

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.

πŸ“œ SIMILAR VOLUMES

Number-theoretic Algorithms in Cryptogra
πŸ“ Number-theoretic Algorithms in Cryptography
✍ O. N. Vasilenko πŸ“‚ Library πŸ“… 2006 πŸ› American Mathematical Society 🌐 English, Russian

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

Number-theoretic Algorithms in Cryptogra
πŸ“ Number-theoretic Algorithms in Cryptography
✍ O. N. Vasilenko πŸ“‚ Library πŸ“… 2006 πŸ› American Mathematical Society 🌐 English

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

Number Theoretic Methods in Cryptography
πŸ“ Number Theoretic Methods in Cryptography: Complexity lower bounds
✍ Igor Shparlinski (auth.) πŸ“‚ Library πŸ“… 1999 πŸ› BirkhΓ€user Basel 🌐 English

<p>The book introduces new techniques which imply rigorous lower bounds on the complexity of some number theoretic and cryptographic problems. These methods and techniques are based on bounds of character sums and numbers of solutions of some polynomial equations over finite fields and residue rings

Number Theoretic Methods in Cryptography
πŸ“ Number Theoretic Methods in Cryptography: Complexity lower bounds
✍ Igor Shparlinski πŸ“‚ Library πŸ“… 1999 πŸ› BirkhΓ€user Basel 🌐 English

The book introduces new techniques which imply rigorous lower bounds on the complexity of some number theoretic and cryptographic problems. These methods and techniques are based on bounds of character sums and numbers of solutions of some polynomial equations over finite fields and residue rings. I