This textbook effectively builds a bridge from basic number theory to recent advances in applied number theory. It presents the first unified account of the four major areas of application where number theory plays a fundamental role, namely cryptography, coding theory, quasi-Monte Carlo methods, and pseudorandom number generation, allowing the authors to delineate the manifold links and interrelations between these areas. Number theory, which Carl-Friedrich Gauss famously dubbed the queen of mathematics, has always been considered a very beautiful field of mathematics, producing lovely results and elegant proofs. While only very few real-life applications were known in the past, today number theory can be found in everyday life: in supermarket bar code scanners, in our cars’ GPS systems, in online banking, etc. Starting with a brief introductory course on number theory in Chapter 1, which makes the book more accessible for undergraduates, the authors describe the four main application areas in Chapters 2-5 and offer a glimpse of advanced results that are presented without proofs and require more advanced mathematical skills. In the last chapter they review several further applications of number theory, ranging from check-digit systems to quantum computation and the organization of raster-graphics memory. Upper-level undergraduates, graduates and researchers in the field of number theory will find this book to be a valuable resource.

Challenge: Can you find all the integers a, b, c satisfying 2a2+3b2=5c2? Looks simple, and there are in fact a number of easy solutions. But most of them turn out to be anything but obvious! There are infinitely many possibilities, and as any computer will tell you, each of a, b, c will usually be large. So the challenge remains … Find all integers a a, b, c satisfying 2a2+3b2=5c2 A major advance in number theory means this book can give an easy answer to this and countless similar questions. The idea behind the approach is transforming a degree-two equation in integer variables a, b, c into a plane curve defined by a polynomial. Working with the curve makes obtaining solutions far easier, and the geometric solutions then get translated back into integers. This method morphs hard problems into routine ones and typically requires no more than high school math. (The complete solution to 2a2+3b2=5c2 is included in the book.) In addition to equations of degree two, the book addresses degree-three equations—a branch of number theory that is today something of a cottage industry, and these problems translate into “elliptic curves”. This important part of the book includes many pictures along with the exposition, making the material meaningful and easy to grasp. This book will fit nicely into an introductory course on number theory. In addition, the many solved examples, illustrations, and exercises make self-studying the book an option for students, thus becoming a natural candidate for a capstone course.

This book provides a good introduction to the classical elementary number theory and the modern algorithmic number theory, and their applications in computing and information technology, including computer systems design, cryptography and network security. In this second edition proofs of many theorems have been provided, further additions and corrections were made.

The only book to provide a unified view of the interplay between computational number theory and cryptography Computational number theory and modern cryptography are two of the most important and fundamental research fields in information security. In this book, Song Y. Yang combines knowledge of these two critical fields, providing a unified view of the relationships between computational number theory and cryptography. The author takes an innovative approach, presenting mathematical ideas first, thereupon treating cryptography as an immediate application of the mathematical concepts. The book also presents topics from number theory, which are relevant for applications in public-key cryptography, as well as modern topics, such as coding and lattice based cryptography for post-quantum cryptography. The author further covers the current research and applications for common cryptographic algorithms, describing the mathematical problems behind these applications in a manner accessible to computer scientists and engineers. Makes mathematical problems accessible to computer scientists and engineers by showing their immediate application Presents topics from number theory relevant for public-key cryptography applications Covers modern topics such as coding and lattice based cryptography for post-quantum cryptography Starts with the basics, then goes into applications and areas of active research Geared at a global audience; classroom tested in North America, Europe, and Asia Incudes exercises in every chapter Instructor resources available on the book’s Companion Website Computational Number Theory and Modern Cryptography is ideal for graduate and advanced undergraduate students in computer science, communications engineering, cryptography and mathematics. Computer scientists, practicing cryptographers, and other professionals involved in various security schemes will also find this book to be a helpful reference.

This book is an attempt to describe the gradual development of the major schools of research on number theory in South India, Punjab, Mumbai, Bengal, and Bihar—including the establishment of Tata Institute of Fundamental Research (TIFR), Mumbai, a landmark event in the history of research of number theory in India. Research on number theory in India during modern times started with the advent of the iconic genius Srinivasa Ramanujan, inspiring mathematicians around the world. This book discusses the national and international impact of the research made by Indian number theorists. It also includes a carefully compiled, comprehensive bibliography of major 20th century Indian number theorists making this book important from the standpoint of historic documentation and a valuable resource for researchers of the field for their literature survey. This book also briefly discusses the importance of number theory in the modern world of mathematics, including applications of the results developed by indigenous number theorists in practical fields. Since the book is written from the viewpoint of the history of science, technical jargon and mathematical expressions have been avoided as much as possible.

A collection of papers inspired by the work of Britain's first Fields Medallist, Klaus Roth.

This book highlights the many ideas and algorithms that Peter L. Montgomery has contributed to computational number theory and cryptography.

This book bridges the gap between the many elementary introductions to set theory that are available today and the more advanced, specialized monographs. The authors have taken great care to motivate concepts as they are introduced. The large number of exercises included make this book especially suitable for self-study. Students are guided towards their own discoveries in a lighthearted, yet rigorous manner.

In spite of the fact that arithmetic majors are generally familiar with number hypothesis when they have finished a course in conceptual polynomial math, different students, particularly those in training and the human sciences, regularly require a more essential prologue to the theme. In this book the writer takes care of the issue of keeping up the enthusiasm of understudies at the two levels by offering a combinatorial way to deal with basic number hypothesis. In concentrate number hypothesis from such a point of view, arithmetic majors are saved reiteration and furnished with new bits of knowledge, while different understudies advantage from the subsequent effortlessness of the verifications for some hypotheses. Of specific significance in this content is the creator's accentuation on the estimation of numerical cases in number hypothesis and the part of PCs in getting such illustrations. The point of this book is to acquaint the reader with essential subjects in number hypothesis: hypothesis of distinctness, arithmetrical capacities, prime numbers, geometry of numbers, added substance number hypothesis, probabilistic number hypothesis, hypothesis of Diophantine approximations and logarithmic number hypothesis.

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.