A01=S.C. Coutinho
advanced number theory for cryptography
algorithmic number theory
Author_S.C. Coutinho
Carmichael Number
Category=PB
Category=PBH
Computer Algebra System
Congruence Modulo
cryptographic algorithms
cryptography
cryptosystem
Electronic Message
Elliptic Curve
eq_isMigrated=1
eq_isMigrated=2
eq_nobargain
Euclidean Algorithm
extended
Factorization Algorithm
Fermat Numbers
fermat's
Fermat's Theorem
Fermat’s Theorem
Greatest Common Divisor
integer
integer factorization methods
Key Lemma
Lagrange's Theorem
Lagrange’s Theorem
Lucas Lehmer Test
mathematical induction applications
Mersenne Numbers
Mod 13
Mod P2
Mod Ri
Modular Arithmetic
modular computation techniques
number
positive
primality testing strategies
prime
Prime Number Theorem
Public Key Cryptosystem
Quadratic Sieve
rsa
RSA Cryptography
RSA Cryptosystem
Smallest Prime Factor
Strong Pseudoprime
theorem
Product details
- ISBN 9780367447601
- Weight: 453g
- Dimensions: 152 x 229mm
- Publication Date: 02 Dec 2019
- Publisher: Taylor & Francis Ltd
- Publication City/Country: GB
- Product Form: Paperback
Secure
checkout
Fast Shipping
Easy returns
This book is an introduction to the algorithmic aspects of number theory and its applications to cryptography, with special emphasis on the RSA cryptosys-tem. It covers many of the familiar topics of elementary number theory, all with an algorithmic twist. The text also includes many interesting historical notes.
Coutinho, S.C.
