Guide to pairing-based cryptography (Q2832131)

The book is divided into twelve chapters each of them written by a different authors. Within each chapter one can find its own references. Nevertheless all chapter are connected and guided by a common goal, introduce, explain and describe the main ingredients in pairing-based cryptography.NEWLINENEWLINEFirst chapter is a elementary introduction to pairing-based cryptography. Second chapter provides the necessary tools to understand the book, essentially finite fields and elliptic curves. Third chapter explains in details the more important pairings, Weil and Tate Pairings. Moreover, they provide some techniques to speed such a pairings. Four Chapter explain how to find elliptic curves suitable for pairing-based cryptography. Chapter five introduces the arithmetic of finite fields with the aim of optimize all the computations. In chapter six scalar multiplication and exponentiation in pairings groups is explained in an optimal way in order to enhance the performance of group operations that are not the pairing computation. In chapter seven several techniques that reduce the computational cost of the final exponentiation are explained, this is one of the main steps in Tate pairing. Chapter eight provides practical, efficient and secure algorithms for hashing values to elliptic curve subgroups. In chapter nine the Discrete Logarithm Problem (DLP) is discussed, the commonly groups used and the algorithms available to compute DLP. Chapter ten explains how to construct and choose the parameters necessary to implement a pairing. Chapter eleven explains how to optimize software implementations for pairing-based cryptography. For it is necessary to reduce finite fields operations and implement finite fields and big-integers operations efficiently. Chapter twelve explains side channel attacks and fault attacks and also provides possible countermeasures against them.NEWLINENEWLINENEWLINETABLE OF CONTENTS:NEWLINENEWLINENEWLINE1) Pairing-Based Cryptography.NEWLINENEWLINE2) Mathematical Background.NEWLINENEWLINE3) Pairings.NEWLINENEWLINE4) Pairing-Friendly Elliptic Curves.NEWLINENEWLINE5) Arithmetic of Finite Fields.NEWLINENEWLINE6) Scalar Multiplication and Exponentiation in Pairing Groups.NEWLINENEWLINE7) Final Exponentiation.NEWLINENEWLINE8) Hashing into Elliptic curves.NEWLINENEWLINE9) Discrete Logarithms.NEWLINENEWLINE10) Choosing parameters.NEWLINENEWLINE11) Software implementations.NEWLINENEWLINE12) Physical Attacks.