Guide to Pairing-Based Cryptography

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...

Full description

Saved in:

Bibliographic Details
Main Authors:	El Mrabet, Nadia, Joye, Marc
Format:	eBook Book
Language:	English
Published:	Boca Raton CRC Press 2017 CRC Press, Taylor & Francis Group CRC Press LLC Chapman & Hall
Edition:	1
Series:	Chapman & Hall/CRC Cryptography and Network Security Series
Subjects:	Combinatorics Computer Science computer scientists COMPUTERSCIENCEnetBASE Cryptography Cryptography and Security Cryptology curve curves Curves, Elliptic Data encryption (Computer science) Data encryption (Computer science) > Mathematics degree elliptic embedding exponentiation field final finite identity-based cryptography INFORMATIONSCIENCEnetBASE InfoSECURITYnetBASE IT Security ITECHnetBASE Mathematics MATHnetBASE pairing-based cryptography SCI-TECHnetBASE security professionals Sets of pairs of functions to be distinguished STMnetBASE tate Pairing Computation Discrete Logarithm Elliptic Curve Frobenius Map Finite Field Miller Loop Computational Diffie Hellman Assumption Scalar Multiplication Final Exponentiation Elliptic Curves Tate Pairings Hash Function Identity Based Encryption Asymptotic Complexity Frobenius Endomorphism Random Oracle Fault Attacks KSS Miller Algorithm Mod 12 Embedding Degree Jacobian Coordinates Unsigned Char Cyclotomic Polynomial Affine Coordinates Pairing-based cryptography
ISBN:	1498729509, 9781498729505, 9780367658229, 0367658224
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Table of Contents:

Cover -- Half Title -- Series Page -- Title Page -- Copyright Page -- Table of Contents -- Foreword -- Symbol Description -- 1: Pairing-Based Cryptography Sébastien Canard and Jacques Traoré -- 2: Mathematical Background Jean-Luc Beuchat, Nadia El Mrabet, Laura Fuentes-Castañeda, and Francisco Rodríguez-Henríquez -- 3: Pairings Sorina Ionica and Damien Robert -- 4: Pairing-Friendly Elliptic Curves Safia Haloui and Edlyn Teske -- 5: Arithmetic of Finite Fields Jean Luc Beuchat, Luis J. Dominguez Perez, Sylvain Duquesne, Nadia El Mrabet, Laura Fuentes-Castañeda, and Francisco Rodríguez-Henríquez -- 6: Scalar Multiplication and Exponentiation in Pairing Groups Joppe Bos, Craig Costello, and Michael Naehrig -- 7: Final Exponentiation Jean-Luc Beuchat, Luis J. Dominguez Perez, Laura Fuentes-Castaneda, and Francisco Rodriguez-Henriquez -- 8: Hashing into Elliptic Curves Eduardo Ochoa-Jiménez, Francisco Rodríguez- Henríquez, and Mehdi Tibouchi -- 9: Discrete Logarithms Aurore Guillevic and François Morain -- 10: Choosing Parameters Sylvain Duquesne, Nadia El Mrabet, Safia Haloui, Damien Robert, and Franck Rondepierre -- 11: Software Implementation Diego F. Aranha, Luis J. Dominguez Perez, Amine Mrabet, and Peter Schwabe -- 12: Physical Attacks Nadia El Mrabet, Louis Goubin, Sylvain Guilley, Jacques Fournier, Damien Jauvart, Martin Moreau, Pablo Rauzy, and Franck Rondepierre -- Bibliography -- Index