Guide to pairing-based cryptography
attacksDLPelliptic curvesexponentiationfinal exponentiationfinite fieldshashingimplementationspairing-based cryptographypairing-friendly elliptic curvesparametersscalar multiplicationTate pairingWeil pairing
Elliptic curves over global fields (11G05) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Applications to coding theory and cryptography of arithmetic geometry (14G50) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Proceedings, conferences, collections, etc. pertaining to information and communication theory (94-06) Cryptography (94A60)
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.
- An introduction to pairing-based cryptography
- Pairing‐Based Cryptography
- Pairing-based cryptography
- On pairing-based cryptosystems
- A survey of pairing-based cryptography
- Pairing-based cryptography and its security analysis
- Pairing-based cryptography and its security analysis
- Cryptography and Coding
- Pairing-based cryptography: past, present, and future
- Pairings for cryptographers
- Generating pairing-friendly elliptic curve parameters using sparse families
- Choosing and generating parameters for pairing implementation on BN curves
- New point compression method for elliptic \(\mathbb{F}_{q^2}\)-curves of \(j\)-invariant 0
- Updating key size estimations for pairings
- Indifferentiable hashing to ordinary elliptic \(\mathbb{F}_{q} \)-curves of \(j=0\) with the cost of one exponentiation in \(\mathbb{F}_{q} \)
- Hashing to elliptic curves of \(j\)-invariant 1728
- Efficient hash maps to \(\mathbb{G}_2\) on BLS curves
- LOVE a pairing
- Hashing to elliptic curves of j=0 and Mordell-Weil groups
- TNFS resistant families of pairing-friendly elliptic curves
- The most efficient indifferentiable hashing to elliptic curves of \(j\)-invariant 1728
- Tower building technique on elliptic curve with embedding degree 18
- Designing a code generator for pairing based cryptographic functions
- Pairing-based cryptography
- Optimal Encodings to Elliptic Curves of \(\boldsymbol{j}\)-Invariants 0, 1728
- Faster point compression for elliptic curves of \(j\)-invariant 0
- Introduction to identity-based encryption.
- Fast hashing to \(\mathbb{G}_2\) on pairing-friendly curves with the lack of twists
- Finite field arithmetic in large characteristic for classical and post-quantum cryptography
- New versions of Miller-loop secured against side-channel attacks
- Hashing to elliptic curves through Cipolla-Lehmer-Müller's square root algorithm
- Faster optimal ate pairings for cyclotomic sparse families of pairing-friendly elliptic curves with embedding degrees k=5,7
- Simultaneously simple universal and indifferentiable hashing to elliptic curves
- Optimizing and securing GLV multiplication over BLS pairings-friendly curves
- Batch point compression in the context of advanced pairing-based protocols
- Point (de)compression for elliptic curves over highly 2-adic finite fields
- Application of Mordell-Weil lattices with large kissing numbers to acceleration of multiscalar multiplication on elliptic curves
- Generation of two ``Independent points on an elliptic curve of \(j\)-invariant \(\neq 0, 1728\)
- Truncated multiplication and batch software SIMD AVX512 implementation for faster Montgomery multiplications and modular exponentiation
This page was built for publication: Guide to pairing-based cryptography
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2832131)
