Written by an authority with great practical and teaching experience in the field, this book addresses a number of topics in computational number theory. Chapters one through five form a homogenous subject matter suitable for a six-month or year-long course in computational number theory. The subsequent chapters deal with more miscellaneous subjects.

Developed from the author's popular graduate-level course, Computational Number Theory presents a complete treatment of number-theoretic algorithms. Avoiding advanced algebra, this self-contained text is designed for advanced undergraduate and beginning graduate students in engineering. It is also suitable for researchers new to the field and pract

This book provides a comprehensive introduction to advanced topics in the computational and algorithmic aspects of number theory, focusing on applications in cryptography. Readers will learn to develop fast algorithms, including quantum algorithms, to solve various classic and modern number theoretic problems. Key problems include prime number generation, primality testing, integer factorization, discrete logarithms, elliptic curve arithmetic, conjecture and numerical verification. The author discusses quantum algorithms for solving the Integer Factorization Problem (IFP), the Discrete Logarithm Problem (DLP), and the Elliptic Curve Discrete Logarithm Problem (ECDLP) and for attacking IFP, DLP and ECDLP based cryptographic systems. Chapters also cover various other quantum algorithms for Pell's equation, principal ideal, unit group, class group, Gauss sums, prime counting function, Riemann's hypothesis and the BSD conjecture. Quantum Computational Number Theory is self-contained and intended to be used either as a graduate text in computing, communications and mathematics, or as a basic reference in the related fields. Number theorists, cryptographers and professionals working in quantum computing, cryptography and network security will find this book a valuable asset.

A Course in Computational Number Theory uses the computer as a tool for motivation and explanation. The book is designed for the reader to quickly access a computer and begin doing personal experiments with the patterns of the integers. It presents and explains many of the fastest algorithms for working with integers. Traditional topics are covered, but the text also explores factoring algorithms, primality testing, the RSA public-key cryptosystem, and unusual applications such as check digit schemes and a computation of the energy that holds a salt crystal together. Advanced topics include continued fractions, Pell’s equation, and the Gaussian primes.

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.

One of the oldest branches of mathematics, number theory is a vast field devoted to studying the properties of whole numbers. Offering a flexible format for a one- or two-semester course, Introduction to Number Theory uses worked examples, numerous exercises, and two popular software packages to describe a diverse array of number theory topi

Now in paperback, this classic book is addresssed to all lovers of number theory. On the one hand, it gives a comprehensive introduction to constructive algebraic number theory, and is therefore especially suited as a textbook for a course on that subject. On the other hand many parts go beyond an introduction an make the user familliar with recent research in the field. For experimental number theoreticians new methods are developed and new results are obtained which are of great importance for them. Both computer scientists interested in higher arithmetic and those teaching algebraic number theory will find the book of value.

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.

News about this title: — Author Marty Weissman has been awarded a Guggenheim Fellowship for 2020. (Learn more here.) — Selected as a 2018 CHOICE Outstanding Academic Title — 2018 PROSE Awards Honorable Mention An Illustrated Theory of Numbers gives a comprehensive introduction to number theory, with complete proofs, worked examples, and exercises. Its exposition reflects the most recent scholarship in mathematics and its history. Almost 500 sharp illustrations accompany elegant proofs, from prime decomposition through quadratic reciprocity. Geometric and dynamical arguments provide new insights, and allow for a rigorous approach with less algebraic manipulation. The final chapters contain an extended treatment of binary quadratic forms, using Conway's topograph to solve quadratic Diophantine equations (e.g., Pell's equation) and to study reduction and the finiteness of class numbers. Data visualizations introduce the reader to open questions and cutting-edge results in analytic number theory such as the Riemann hypothesis, boundedness of prime gaps, and the class number 1 problem. Accompanying each chapter, historical notes curate primary sources and secondary scholarship to trace the development of number theory within and outside the Western tradition. Requiring only high school algebra and geometry, this text is recommended for a first course in elementary number theory. It is also suitable for mathematicians seeking a fresh perspective on an ancient subject.

This two-volume book is a modern introduction to the theory of numbers, emphasizing its connections with other branches of mathematics. Part A is accessible to first-year undergraduates and deals with elementary number theory. Part B is more advanced and gives the reader an idea of the scope of mathematics today. The connecting theme is the theory of numbers. By exploring its many connections with other branches a broad picture is obtained. The book contains a treasury of proofs, several of which are gems seldom seen in number theory books.