Introduction to Number Theory with Cryptography
-10%
portes grátis
Introduction to Number Theory with Cryptography
Washington, Lawrence; Kraft, James
Taylor & Francis Ltd
01/2018
578
Dura
Inglês
9781138063471
15 a 20 dias
952
Descrição não disponível.
20 1. Introduction; 2 Divisibility; 3. Linear Diophantine Equations; 4. Unique Factorization; 5. Applications of Unique Factorization; 6. Conguences; 7. Classsical Cryposystems; 8. Fermat, Euler, Wilson; 9. RSA; 10. Polynomial Congruences; 11. Order and Primitive Roots; 12. More Cryptographic Applications; 13. Quadratic Reciprocity; 14. Primality and Factorization; 15. Geometry of Numbers; 16. Arithmetic Functions; 17. Continued Fractions; 18. Gaussian Integers; 19. Algebraic Integers; 20. Analytic Methods, 21. Epilogue: Fermat's Last Theorem; Appendices; Answers and Hints for Odd-Numbered Exercises; Index
Este título pertence ao(s) assunto(s) indicados(s). Para ver outros títulos clique no assunto desejado.
Extended Euclidean Algorithm;Mod 13;Number theory;Positive Integer;Cryptography;Fermat's Theorem;Induction;Chinese Remainder Theorem;Factorization;RSA Cryptosystem;Cryptogaphic applications;Odd Primes;Integers;Gaussian Integers;James S. Kraft;Pythagorean Triples;Lawrence C. Washington;Pell's Equation;Euclidean Algorithm;Primitive Root;Quadratic Reciprocity;Primitive Roots Mod;RSA Signature Scheme;Discrete Log Problem;Primes;Linear Diophantine Equation;Prime Number Theorem;Elliptic Curves;Mersenne Primes;Congruences Mod;Solution Mod;Division Algorithm;Integer Coefficients
20 1. Introduction; 2 Divisibility; 3. Linear Diophantine Equations; 4. Unique Factorization; 5. Applications of Unique Factorization; 6. Conguences; 7. Classsical Cryposystems; 8. Fermat, Euler, Wilson; 9. RSA; 10. Polynomial Congruences; 11. Order and Primitive Roots; 12. More Cryptographic Applications; 13. Quadratic Reciprocity; 14. Primality and Factorization; 15. Geometry of Numbers; 16. Arithmetic Functions; 17. Continued Fractions; 18. Gaussian Integers; 19. Algebraic Integers; 20. Analytic Methods, 21. Epilogue: Fermat's Last Theorem; Appendices; Answers and Hints for Odd-Numbered Exercises; Index
Este título pertence ao(s) assunto(s) indicados(s). Para ver outros títulos clique no assunto desejado.
Extended Euclidean Algorithm;Mod 13;Number theory;Positive Integer;Cryptography;Fermat's Theorem;Induction;Chinese Remainder Theorem;Factorization;RSA Cryptosystem;Cryptogaphic applications;Odd Primes;Integers;Gaussian Integers;James S. Kraft;Pythagorean Triples;Lawrence C. Washington;Pell's Equation;Euclidean Algorithm;Primitive Root;Quadratic Reciprocity;Primitive Roots Mod;RSA Signature Scheme;Discrete Log Problem;Primes;Linear Diophantine Equation;Prime Number Theorem;Elliptic Curves;Mersenne Primes;Congruences Mod;Solution Mod;Division Algorithm;Integer Coefficients
