Introduction to Number Theory with Cryptography
portes grátis
Introduction to Number Theory with Cryptography
Washington, Lawrence C.; Kraft, James S.
Taylor & Francis Ltd
10/2024
572
Mole
9781032918563
15 a 20 dias
Descrição não disponível.
Introduction. Divisibility. Unique Factorization. Applications of Unique Factorization. Congruences. Cryptographic Applications. Polynomial Congruences. Order and Primitive Roots. More Cryptographic Applications. Quadratic Reciprocity. Primality and Factorization. Geometry of Numbers. Arithmetic Functions. Continued Fractions. Gaussian Integers. Algebraic Integers. Analytic Methods. Epilogue: Fermat's Last Theorem. A Supplementary Topics.
Este título pertence ao(s) assunto(s) indicados(s). Para ver outros títulos clique no assunto desejado.
RSA Cryptosystem;Extended Euclidean Algorithm;Primitive Root Mod;Mod 21;Mod 13;Gaussian Integers;Linear Diophantine Equations;Discrete Log Problem;Pell's Equation;Pythagorean Triple;Algebraic Integers;Chinese Remainder Theorem;Euclidean Algorithm;Quadratic Reciprocity;Odd Primes;Fermat's Theorem;RSA Modulus;Primitive Root;Mersenne Primes;Mod Pn;Prime Number Theorem;Division Algorithm;Integer Coefficients;Gimp;Positive Integers
Introduction. Divisibility. Unique Factorization. Applications of Unique Factorization. Congruences. Cryptographic Applications. Polynomial Congruences. Order and Primitive Roots. More Cryptographic Applications. Quadratic Reciprocity. Primality and Factorization. Geometry of Numbers. Arithmetic Functions. Continued Fractions. Gaussian Integers. Algebraic Integers. Analytic Methods. Epilogue: Fermat's Last Theorem. A Supplementary Topics.
Este título pertence ao(s) assunto(s) indicados(s). Para ver outros títulos clique no assunto desejado.
RSA Cryptosystem;Extended Euclidean Algorithm;Primitive Root Mod;Mod 21;Mod 13;Gaussian Integers;Linear Diophantine Equations;Discrete Log Problem;Pell's Equation;Pythagorean Triple;Algebraic Integers;Chinese Remainder Theorem;Euclidean Algorithm;Quadratic Reciprocity;Odd Primes;Fermat's Theorem;RSA Modulus;Primitive Root;Mersenne Primes;Mod Pn;Prime Number Theorem;Division Algorithm;Integer Coefficients;Gimp;Positive Integers