This book is devoted to efficient pairing computations and implementations, useful tools for cryptographers working on topics like identity-based cryptography and the simplification of existing protocols like signature schemes. As well as exploring the basic mathematical background of finite fields and elliptic curves, Guide to Pairing-Based Cryptography offers an overview of the most recent developments in optimizations for pairing implementation. Each chapter includes a presentation of the problem it discusses, the mathematical formulation, a discussion of implementation issues, solutions accompanied by code or pseudocode, several numerical results, and references to further reading and notes. Intended as a self-contained handbook, this book is an invaluable resource for computer scientists, applied mathematicians and security professionals interested in cryptography.
" ... Many texts in this realm devote space to enciphering history. Much of that material seems quaint and more entertaining than material when presented. In this case, mathematical background in cryptographic usage of elliptic curves over a finite field offers a more modern and useful set of fundamentals. You will just have to read about the antique Caesar cipher elsewhere. This spreads over several chapters for a very self-contained offering. This implementation sourcebook includes background theory in pairings, finite field arithmetic, scalar multiplication and exponentiation in pairing groups, discrete logarithms, cyclotomic groups, hashing into elliptic curves, pairing-friendly elliptic curves, and more. ..."