A Computational Introduction to Number Theory and Algebra

dc.contributor.author	Shoup, Victor	en_US
dc.date.accessioned	2016-06-25T01:55:22Z
dc.date.available	2016-06-25T01:55:22Z
dc.date.issued	2008	en_US
dc.identifier.other	HPU3160304	en_US
dc.identifier.uri	https://lib.hpu.edu.vn/handle/123456789/21609
dc.description.abstract	Chapter 1: Basic properties of the integers. Chapter 2: Congruences. Chapter 3: Computing with large integers. Chapter 4: Euclid’s algorithm. Chapter 5: The distribution of primes. Chapter 6: Abelian groups. Chapter 7: Rings. Chapter 8: Finite and discrete probability distributions. Chapter 9: Probabilistic algorithms. Chapter 10: Probabilistic primality testing. Chapter 11: Finding generators and discrete logarithms in Z∗p. Chapter 12: Quadratic reciprocity and computing modular square roots. Chapter 13: Modules and vector spaces. Chapter 14: Matrices. Chapter 15: Subexponential-time discrete logarithms and factoring. Chapter 16: More rings. Chapter 17: Polynomial arithmetic and applications. Chapter 18: Finite Fields. Chapter 19: Linearly generated sequences and applications. Chapter 20: Algorithms for finite fields. Chapter 21: Deterministic primality testing.	en_US
dc.format.extent	598 p.	en_US
dc.format.mimetype	application/pdf
dc.language.iso	en	en_US
dc.publisher	Cambridge University Press	en_US
dc.subject	Mathematics	en_US
dc.subject	Statistics	en_US
dc.subject	Computational	en_US
dc.title	A Computational Introduction to Number Theory and Algebra	en_US
dc.type	Book	en_US
dc.size	3,563KB	en_US
dc.department	Education	en_US