This book presents multiprecision algorithms used in number theory and elsewhere, such as extrapolation, numerical integration, numerical summation (including multiple zeta values and the Riemann-Siegel formula), evaluation and speed of convergence of continued fractions, Euler products and Euler sums, inverse Mellin transforms, and complex L L-functions. For each task, many algorithms are presented, such as Gaussian and doubly-exponential integration, Euler-MacLaurin, Abel-Plana, Lagrange, and Monien summation. Each algorithm is given in detail, together with a complete implementation in the free Pari/GP system. These implementations serve both to make even more precise the inner workings of the algorithms, and to gently introduce advanced features of the Pari/GP language. This book will be appreciated by anyone interested in number theory, specifically in practical implementations, computer experiments and numerical algorithms that can be scaled to produce thousands of digits of accuracy.

This volume collects lecture notes and research articles from the International Autumn School on Computational Number Theory, which was held at the Izmir Institute of Technology from October 30th to November 3rd, 2017 in Izmir, Turkey. Written by experts in computational number theory, the chapters cover a variety of the most important aspects of the field. By including timely research and survey articles, the text also helps pave a path to future advancements. Topics include: Modular forms L-functions The modular symbols algorithm Diophantine equations Nullstellensatz Eisenstein series Notes from the International Autumn School on Computational Number Theory will offer graduate students an invaluable introduction to computational number theory. In addition, it provides the state-of-the-art of the field, and will thus be of interest to researchers interested in the field as well.

This book constitutes the refereed proceedings of the Second International Workshop on the Arithmetic of Finite Fields, WAIFI 2008, held in Siena, Italy, in July 2008. The 16 revised full papers presented were carefully reviewed and selected from 34 submissions. The papers are organized in topical sections on structures in finite fields, efficient finite field arithmetic, efficient implementation and architectures, classification and construction of mappings over finite fields, and codes and cryptography.

This volume is an original collection of articles by 44 leading mathematicians on the theme of the future of the discipline. The contributions range from musings on the future of specific fields, to analyses of the history of the discipline, to discussions of open problems and conjectures, including first solutions of unresolved problems. Interestingly, the topics do not cover all of mathematics, but only those deemed most worthy to reflect on for future generations. These topics encompass the most active parts of pure and applied mathematics, including algebraic geometry, probability, logic, optimization, finance, topology, partial differential equations, category theory, number theory, differential geometry, dynamical systems, artificial intelligence, theory of groups, mathematical physics and statistics.

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.

This book constitutes the refereed proceedings of the 5th International Conference on the Theory and Application of Cryptographic Techniques in Africa, AFRICACRYPT 2011, held in Ifrane, Morocco, in July 2012. The 24 papers presented together with abstracts of 2 invited talks were carefully reviewed and selected from 56 submissions. They are organized in topical sections on signature schemes, stream ciphers, applications of information theory, block ciphers, network security protocols, public-key cryptography, cryptanalysis of hash functions, hash functions: design and implementation, algorithms for public-key cryptography, and cryptographic protocols.

This book will be published Open Access with a Creative Commons Attribution 4.0 International License (CC BY 4.0). The eBook can be downloaded electronically for free. This volume contains the proceedings of the LuCaNT (LMFDB, Computation, and Number Theory) conference held from July 10–14, 2023, at the Institute for Computational and Experimental Research in Mathematics (ICERM), Providence, Rhode Island and affiliated with Brown University. This conference provided an opportunity for researchers, scholars, and practitioners to exchange ideas, share advances, and collaborate in the fields of computation, mathematical databases, number theory, and arithmetic geometry. The papers that appear in this volume record recent advances in these areas, with special focus on the LMFDB (the L-Functions and Modular Forms Database), an online resource for mathematical objects arising in the Langlands program and the connections between them.