WorldCat Linked Data Explorer

Turtle N-Triple JSON-LD RDF/XML HTML Contact Us Home

http://worldcat.org/entity/work/id/890884167

Elementary number theory primes, congruences, and secrets

This is a textbook about classical elementary number theory and elliptic curves. The first part discusses elementary topics such as primes, factorization, continued fractions, and quadratic forms, in the context of cryptography, computation, and deep open research problems. The second part is about elliptic curves, their applications to algorithmic problems, and their connections with problems in number theory such as Fermatās Last Theorem, the Congruent Number Problem, and the Conjecture of Birch and Swinnerton-Dyer. The intended audience of this book is an undergraduate with some familiarity with basic abstract algebra, e.g. rings, fields, and finite abelian groups.

Open All Close All

type

about

http://schema.org/about

author

contributor

creator

description

http://schema.org/description

  • "This is a textbook about classical elementary number theory and elliptic curves. The first part discusses elementary topics such as primes, factorization, continued fractions, and quadratic forms, in the context of cryptography, computation, and deep open research problems. The second part is about elliptic curves, their applications to algorithmic problems, and their connections with problems in number theory such as Fermatās Last Theorem, the Congruent Number Problem, and the Conjecture of Birch and Swinnerton-Dyer. The intended audience of this book is an undergraduate with some familiarity with basic abstract algebra, e.g. rings, fields, and finite abelian groups."@en
  • "The systematic study of number theory was initiated around 300B.C. when Euclid proved that there are infinitely many prime numbers. At the same time, he also cleverly deduced the fundamental theorem of arithmetic, which asserts that every positive integer factors uniquely as a product of primes. Over 1000 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 1000 years later (in 1976), Diffie and Hellman introduced the first ever public-key cryptosystem, which enabled two people to communicate secretly 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, public-key cryptography, attacks on public-key systems, and playing a central role in Andrew Wiles' resolution of Fermat's Last Theorem. Today, pure and applied number theory is an exciting mix of simultaneously broad and deep theory, which is constantly informed and motivated by algorithms and explicit computation. Active research is underway that promises to resolve the congruent number problem, deepen our understanding into the structure of prime numbers, and both challenge and improve our ability to communicate securely. The goal of this book is to bring the reader closer to this world. Each chapter contains exercises, and throughout the text there are examples of calculations done using the powerful free open source mathematical software system Sage. The reader should know how to read and write mathematical proofs and must know the basics of groups, rings, and fields. Thus, the prerequisites for this book are more than the prerequisites for most elementary number theory books, while still being aimed at undergraduates. William Stein is an Associate Professor of Mathematics at the University of Washington. He is also the author of Modular Forms, A Computational Approach (AMS 2007), and the lead developer of the open source software, Sage."@en
  • "Explains classical elementary number theory and elliptic curves. This book discusses elementary topics such as primes, factorization, continued fractions, and quadratic forms, in the context of cryptography and computation. It details elliptic curves, their applications to algorithmic problems, and their connections with problems in number theory."@en

genre

http://schema.org/genre

  • "Lehrbuch"
  • "Electronic books"
  • "Electronic books"@en

name

http://schema.org/name

  • "Elementary number theory primes, congruences, and secrets"
  • "Elementary number theory primes, congruences, and secrets"@en
  • "Elementary number theory : primes, congruences, and secrets ; a computational approach"
  • "Elementary Number Theory Primes, Congruences, and Secrets"@en
  • "Elementary number theory : primes, congruences, and secrets : a computational approach"
  • "Elementary number theory : primes, congruences, and secrets : a computational approach"@en
  • "Elementary number theory: primes, congruences, and secrets"
  • "Elementary number theory : primes, congruences, and secrets :a computational approach"
  • "Elementary number theory primes, congruences, and secrets : a computational approach"
  • "Elementary number theory primes, congruences, and secrets : a computational approach"@en
  • "Elementary number theory primes, congruences, and secrets; a computational approach"
  • "Elementary number theory : primes, congruences, and secrets"
  • "Elementary Number Theory: Primes, Congruences, and Secrets A Computational Approach"
  • "Elementary Number Theory: Primes, Congruences, and Secrets : A Computational Approach"

workExample