Neal Koblitz

This is a textbook for a course (or self-instruction) in cryptography with emphasis on algebraic methods. The first half of the book is a self-contained informal introduction to areas of algebra, number theory, and computer science that are used in cryptography. Most of the material in the second half - "hidden monomial" systems, combinatorial-algebraic systems, and hyperelliptic systems - has not previously appeared in monograph form. The Appendix by Menezes, Wu, and Zuccherato gives an elementary treatment of hyperelliptic curves. This book is intended for graduate students, advanced undergraduates, and scientists working in various fields of data security. From the reviews: "... This is a textbook in cryptography with emphasis on algebraic methods. It is supported by many exercises (with answers) making it appropriate for a course in mathematics or computer science. ... Overall, this is an excellent expository text, and will be very useful to both the student and researcher." M.V.D.Burmester, Mathematical Reviews 2002 "... I think this book is a very inspiring book on cryptography. It goes beyond the traditional topics (most of the cryptosystems presented here are first time in a textbook, some of Patarin's work is not published yet). This way the reader has the feeling how easy to suggest a cryptosystem, how easy to break a safe looking system and hence how hard to trust one. The interested readers are forced to think together with their researchers and feel the joy of discovering new ideas. At the same time the importance of "hardcore" mathematics is emphasized and hopefully some application driven students will be motivated to study theory." P. Hajnal, Acta Scientiarum Mathematicarum 64.1998 "... Overall, the book is highly recommended to everyone who has the requisite mathematical sophistication." E.Leiss, Computing Reviews 1998

The theory of elliptic curves and modular forms provides a fruitful meeting ground for such diverse areas as number theory, complex analysis, algebraic geometry, and representation theory. This book starts out with a problem from elementary number theory and proceeds to lead its reader into the modern theory, covering such topics as the Hasse-Weil L-function and the conjecture of Birch and Swinnerton-Dyer. The second edition of this text includes an updated bibliography indicating the latest, dramatic changes in the direction of proving the Birch and Swinnerton conjecture. It also discusses the current state of knowledge of elliptic curves.

This introduction to recent work in p-adic analysis and number theory will make accessible to a relatively general audience the efforts of a number of mathematicians over the last five years. After reviewing the basics (the construction of p-adic numbers and the p-adic analog of the complex number field, power series and Newton polygons), the author develops the properties of p-adic Dirichlet L-series using p-adic measures and integration. p-adic gamma functions are introduced, and their relationship to L-series is explored. Analogies with the corresponding complex analytic case are stressed. Then a formula for Gauss sums in terms of the p-adic gamma function is proved using the cohomology of Fermat and Artin-Schreier curves. Graduate students and research workers in number theory, algebraic geometry and parts of algebra and analysis will welcome this account of current research.

Towards a Quarter-Century of Public Key Cryptography brings together in one place important contributions and up-to-date research results in this fast moving area. Towards a Quarter-Century of Public Key Cryptography serves as an excellent reference, providing insight into some of the most challenging research issues in the field.

This book is a text of mathematical logic on a sophisticated level, presenting the reader with several of the most significant discoveries of the last 10 to 15 years, including the independence of the continuum hypothesis, the Diophantine nature of enumerable sets and the impossibility of finding an algorithmic solution for certain problems. The book contains the first textbook presentation of Matijasevic's result. The central notions are provability and computability; the emphasis of the presentation is on aspects of the theory which are of interest to the working mathematician. Many of the approaches and topics covered are not standard parts of logic courses; they include a discussion of the logic of quantum mechanics, Goedel's constructible sets as a sub-class of von Neumann's universe, the Kolmogorov theory of complexity. Feferman's theorem on Goedel formulas as axioms and Highman's theorem on groups defined by enumerable sets of generators and relations. A number of informal digressions concerned with psychology, linguistics, and common sense logic should interest students of the philosophy of science or the humanities.

The purpose of this book is to introduce the reader to arithmetic topics, both ancient and modern, that have been at the center of interest in applications of number theory, particularly in cryptography. 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, emphasizing estimates of the efficiency of the techniques that arise from the theory. A special feature is the inclusion of recent application of the theory of elliptic curves. Extensive exercises and careful answers have been included in all of the chapters. Because number theory and cryptography are fast-moving fields, this new edition contains substantial revisions and updated references.