Elementary Number Theory: Primes, Congruences, and Secrets: A Computational Approach
Springer Science & Business Media, 28.10.2008 - 168 Seiten
This is a book about prime numbers, congruences, secret messages, and elliptic curves that you can read cover to cover. It grew out of undergr- uate courses that the author taught at Harvard, UC San Diego, and the University of Washington. The systematic study of number theory was initiated around 300B. C. when Euclid proved that there are in?nitely many prime numbers, and also cleverly deduced the fundamental theorem of arithmetic, which asserts that every positive integer factors uniquely as a product of primes. Over a thousand years later (around 972A. D. ) Arab mathematicians formulated the congruent number problem that asks for a way to decide whether or not a given positive integer n is the area of a right triangle, all three of whose sides are rational numbers. Then another thousand years later (in 1976), Di?e and Hellman introduced the ?rst ever public-key cryptosystem, which enabled two people to communicate secretely over a public communications channel with no predetermined secret; this invention and the ones that followed it revolutionized the world of digital communication. In the 1980s and 1990s, elliptic curves revolutionized number theory, providing striking new insights into the congruent number problem, primality testing, publ- key cryptography, attacks on public-key systems, and playing a central role in Andrew Wiles’ resolution of Fermat’s Last Theorem.
Andere Ausgaben - Alle anzeigen
Elementary Number Theory: Primes, Congruences, and Secrets: A Computational ...
Keine Leseprobe verfügbar - 2010
algebraic algorithm apply approximation asserts assume called Chapter choose complete composite compute congruent number conjecture consider continued fraction convergents cryptosystem cyclic define Definition digits discrete discuss divides divisible divisor element elliptic curve encrypt equality equation exactly Exercise exists fact factorization field FIGURE finite follows function gcd(a give given homomorphism illustrate implement implies infinitely Lemma Math Mathematics method Michael mod n multiple Nikita Note number theory obtain output partial points polynomial positive integer prime numbers primitive root modulo problem Proof Proposition prove quadratic irrational Quadratic Reciprocity question random rational number reduce replaced residues ring SAGE Example satisfies secret Section sequence simple solution solve square step Suppose terminate Theorem true write Z/nZ Z/pZ