The Development of the Number Field Sieve


Book Description

The number field sieve is an algorithm for finding the prime factors of large integers. It depends on algebraic number theory. Proposed by John Pollard in 1988, the method was used in 1990 to factor the ninth Fermat number, a 155-digit integer. The algorithm is most suited to numbers of a special form, but there is a promising variant that applies in general. This volume contains six research papers that describe the operation of the number field sieve, from both theoretical and practical perspectives. Pollard's original manuscript is included. In addition, there is an annotated bibliography of directly related literature.




The Development of the Number Field Sieve


Book Description

The number field sieve is an algorithm for finding the prime factors of large integers. It depends on algebraic number theory. Proposed by John Pollard in 1988, the method was used in 1990 to factor the ninth Fermat number, a 155-digit integer. The algorithm is most suited to numbers of a special form, but there is a promising variant that applies in general. This volume contains six research papers that describe the operation of the number field sieve, from both theoretical and practical perspectives. Pollard's original manuscript is included. In addition, there is an annotated bibliography of directly related literature.




A Course in Computational Algebraic Number Theory


Book Description

A description of 148 algorithms fundamental to number-theoretic computations, in particular for computations related to algebraic number theory, elliptic curves, primality testing and factoring. The first seven chapters guide readers to the heart of current research in computational algebraic number theory, including recent algorithms for computing class groups and units, as well as elliptic curve computations, while the last three chapters survey factoring and primality testing methods, including a detailed description of the number field sieve algorithm. The whole is rounded off with a description of available computer packages and some useful tables, backed by numerous exercises. Written by an authority in the field, and one with great practical and teaching experience, this is certain to become the standard and indispensable reference on the subject.







A Course in Number Theory and Cryptography


Book Description

This is a substantially revised and updated introduction to arithmetic topics, both ancient and modern, that have been at the centre of interest in applications of number theory, particularly in cryptography. As such, no background in algebra or number theory is assumed, and the book begins with a discussion of the basic number theory that is needed. The approach taken is algorithmic, emphasising estimates of the efficiency of the techniques that arise from the theory, and one special feature is the inclusion of recent applications of the theory of elliptic curves. Extensive exercises and careful answers are an integral part all of the chapters.




Prime Obsession


Book Description

In August 1859 Bernhard Riemann, a little-known 32-year old mathematician, presented a paper to the Berlin Academy titled: "On the Number of Prime Numbers Less Than a Given Quantity." In the middle of that paper, Riemann made an incidental remark â€" a guess, a hypothesis. What he tossed out to the assembled mathematicians that day has proven to be almost cruelly compelling to countless scholars in the ensuing years. Today, after 150 years of careful research and exhaustive study, the question remains. Is the hypothesis true or false? Riemann's basic inquiry, the primary topic of his paper, concerned a straightforward but nevertheless important matter of arithmetic â€" defining a precise formula to track and identify the occurrence of prime numbers. But it is that incidental remark â€" the Riemann Hypothesis â€" that is the truly astonishing legacy of his 1859 paper. Because Riemann was able to see beyond the pattern of the primes to discern traces of something mysterious and mathematically elegant shrouded in the shadows â€" subtle variations in the distribution of those prime numbers. Brilliant for its clarity, astounding for its potential consequences, the Hypothesis took on enormous importance in mathematics. Indeed, the successful solution to this puzzle would herald a revolution in prime number theory. Proving or disproving it became the greatest challenge of the age. It has become clear that the Riemann Hypothesis, whose resolution seems to hang tantalizingly just beyond our grasp, holds the key to a variety of scientific and mathematical investigations. The making and breaking of modern codes, which depend on the properties of the prime numbers, have roots in the Hypothesis. In a series of extraordinary developments during the 1970s, it emerged that even the physics of the atomic nucleus is connected in ways not yet fully understood to this strange conundrum. Hunting down the solution to the Riemann Hypothesis has become an obsession for many â€" the veritable "great white whale" of mathematical research. Yet despite determined efforts by generations of mathematicians, the Riemann Hypothesis defies resolution. Alternating passages of extraordinarily lucid mathematical exposition with chapters of elegantly composed biography and history, Prime Obsession is a fascinating and fluent account of an epic mathematical mystery that continues to challenge and excite the world. Posited a century and a half ago, the Riemann Hypothesis is an intellectual feast for the cognoscenti and the curious alike. Not just a story of numbers and calculations, Prime Obsession is the engrossing tale of a relentless hunt for an elusive proof â€" and those who have been consumed by it.




Sieve Methods


Book Description

This text by a noted pair of experts is regarded as the definitive work on sieve methods. It formulates the general sieve problem, explores the theoretical background, and illustrates significant applications. 1974 edition.




Elementary Number Theory: Primes, Congruences, and Secrets


Book Description

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.




An Introduction to Sieve Methods and Their Applications


Book Description

Rather than focus on the technical details which can obscure the beauty of sieve theory, the authors focus on examples and applications, developing the theory in parallel.




Prime Numbers


Book Description

Bridges the gap between theoretical and computational aspects of prime numbers Exercise sections are a goldmine of interesting examples, pointers to the literature and potential research projects Authors are well-known and highly-regarded in the field