Featured

**Jonathan Katz, Yehuda Lindell**

November 6, 2014

Cryptography is ubiquitous and plays a key role in ensuring data secrecy and integrity as well as in securing computer systems more broadly. Introduction to Modern Cryptography provides a rigorous yet accessible treatment of this fascinating subject. The authors introduce the core principles of mode...

Featured

**Douglas Robert Stinson, Maura Paterson**

August 14, 2018

Through three editions, Cryptography: Theory and Practice, has been embraced by instructors and students alike. It offers a comprehensive primer for the subject’s fundamentals while presenting the most current advances in cryptography. The authors offer comprehensive, in-depth treatment of the met...

Featured

**Gary L. Mullen, Daniel Panario**

June 17, 2013

Poised to become the leading reference in the field, the Handbook of Finite Fields is exclusively devoted to the theory and applications of finite fields. More than 80 international contributors compile state-of-the-art research in this definitive handbook. Edited by two renowned researchers, the bo...

Featured

**Craig P. Bauer**

March 25, 2013

Winner of an Outstanding Academic Title Award from CHOICE Magazine Most available cryptology books primarily focus on either mathematics or history. Breaking this mold, Secret History: The Story of Cryptology gives a thorough yet accessible treatment of both the mathematics and history of cryptology...

Featured

**Franz Halter-Koch**

June 17, 2013

Quadratic Irrationals: An Introduction to Classical Number Theory gives a unified treatment of the classical theory of quadratic irrationals. Presenting the material in a modern and elementary algebraic setting, the author focuses on equivalence, continued fractions, quadratic characters, quadratic ...

Featured

**Andrew V. Sills**

October 12, 2017

The Rogers--Ramanujan identities are a pair of infinite series—infinite product identities that were first discovered in 1894. Over the past several decades these identities, and identities of similar type, have found applications in number theory, combinatorics, Lie algebra and vertex operator al...

**Istvan Mezo**

August 20, 2019

Combinatorics and Number Theory of Counting Sequences is an introduction to the theory of finite set partitions and to the enumeration of cycle decompositions of permutations. The presentation prioritizes elementary enumerative proofs. Therefore, parts of the book are designed so that even those...

**Gyorgy Kiss, Tamas Szonyi**

August 02, 2019

Finite Geometries stands out from recent textbooks about the subject of finite geometries by having a broader scope. The authors thoroughly explain how the subject of finite geometries is a central part of discrete mathematics. The text is suitable for undergraduate and graduate courses....

**Sriraman Sridharan, R. Balakrishnan**

July 23, 2019

Conveying ideas in a user-friendly style, this book has been designed for a course in Applied Algebra. The book covers graph algorithms, basic algebraic structures, coding theory and cryptography. It will be most suited for senior undergraduates and beginning graduate students in mathematics and...

**B. V. Senthil Kumar, Hemen Dutta**

July 23, 2019

This book contains fundamental concepts on discrete mathematical structures in an easy to understand style so that the reader can grasp the contents and explanation easily. The concepts of discrete mathematical structures have application to computer science, engineering and information technology...

**San Ling, Huaxiong Wang, Chaoping Xing**

June 12, 2019

The reach of algebraic curves in cryptography goes far beyond elliptic curve or public key cryptography yet these other application areas have not been systematically covered in the literature. Addressing this gap, Algebraic Curves in Cryptography explores the rich uses of algebraic curves in a...

**Michael Z. Spivey**

May 14, 2019

The Art of Proving Binomial Identities accomplishes two goals: (1) It provides a unified treatment of the binomial coefficients, and (2) Brings together much of the undergraduate mathematics curriculum via one theme (the binomial coefficients). The binomial coefficients arise in a variety of areas...

**Richard Alan Gillman, David Housman**

May 09, 2019

Game Theory: A Modeling Approach quickly moves readers through the fundamental ideas of the subject to enable them to engage in creative modeling projects based on game theoretic concepts. The authors match conclusions to real-world scenarios and applications. The text engages students in active...

**Karoly Bezdek, Zsolt Langi**

April 24, 2019

Volume of geometric objects plays an important role in applied and theoretical mathematics. This is particularly true in the relatively new branch of discrete geometry, where volume is often used to find new topics for research. Volumetric Discrete Geometry demonstrates the recent aspects of volume...

**Michael H. Albert, Richard J. Nowakowski, David Wolfe**

April 22, 2019

This second edition of Lessons in Play reorganizes the presentation of the popular original text in combinatorial game theory to make it even more widely accessible. Starting with a focus on the essential concepts and applications, it then moves on to more technical material. Still written in a...

**Brigitte Le Roux, Solène Bienaise, Jean-Luc Durand**

February 22, 2019

Geometric Data Analysis designates the approach of Multivariate Statistics that conceptualizes the set of observations as a Euclidean cloud of points. Combinatorial Inference in Geometric Data Analysis gives an overview of multidimensional statistical inference methods applicable to clouds of...

**Ganesh Gopalakrishnan**

February 22, 2019

Automata and Computability is a class-tested textbook which provides a comprehensive and accessible introduction to the theory of automata and computation. The author uses illustrations, engaging examples, and historical remarks to make the material interesting and relevant for students. It...

**Istvan Miklos**

February 20, 2019

Computational Complexity of Counting and Sampling provides readers with comprehensive and detailed coverage of the subject of computational complexity. It is primarily geared toward researchers in enumerative combinatorics, discrete mathematics, and theoretical computer science. The book covers the...