En savoir plus
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.
Table des matières
Introduction. Mathematical Background. Pairings. Pairing-Friendly Elliptic Curves. Miller's Algorithm. Arithmetic of Finite Fields. Final Exponentiation. Algorithms. Software Implementation. Hardware Implementation.
A propos de l'auteur
Nadia El Mrabet is an assistant professor at SAS - Ecole des Mines de Saint Etienne, Gardanne, France. She previously taught at the University of Paris 8 Vincennes, Saint-Denis, France. She completed her PhD at Université Montpellier 2, France, in 2009.
Marc Joye received his Ph.D. degree in applied sciences (cryptography) from the Université Catholique de Louvain, Belgium, in 1997. In 1998 and 1999, he was a post-doctoral fellow of the National Science Council, Taiwan. From 1999 to 2006, he was with the Card Security Group, Gemplus (now Gemalto), France. From 2006 to 2016, he was with Technicolor (formerly Thomson R&D), France & USA. Since 2016, he has been with NXP Semiconductors, USA.
Résumé
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.
