Guide to Pairing-Based Cryptography

DOI10.1201/9781315370170zbMath1371.94003OpenAlexW2737042076MaRDI QIDQ2832131

No author found.

Publication date: 7 November 2016

Full work available at URL: https://doi.org/10.1201/9781315370170

zbMATH Keywords

parameterselliptic curvesfinite fieldsattacksexponentiationhashingTate pairingWeil pairingpairing-based cryptographyfinal exponentiationscalar multiplicationimplementationsDLPpairing-friendly elliptic curves

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Proceedings, conferences, collections, etc. pertaining to information and communication theory (94-06) Elliptic curves over global fields (11G05) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (18)

Hashing to elliptic curves of \(j\)-invariant 1728 ⋮ Pairing-Based Cryptography ⋮ Efficient hash maps to \(\mathbb{G}_2\) on BLS curves ⋮ Optimal Encodings to Elliptic Curves of \(\boldsymbol{j}\)-Invariants 0, 1728 ⋮ Generating pairing-friendly elliptic curve parameters using sparse families ⋮ LOVE a pairing ⋮ Faster point compression for elliptic curves of $j$-invariant $0$ ⋮ The most efficient indifferentiable hashing to elliptic curves of \(j\)-invariant 1728 ⋮ 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 ⋮ Tower building technique on elliptic curve with embedding degree 18 ⋮ Hashing to elliptic curves through Cipolla-Lehmer-Müller's square root algorithm ⋮ Hashing to elliptic curves of \(j=0\) and Mordell-Weil groups ⋮ New point compression method for elliptic \(\mathbb{F}_{q^2}\)-curves of \(j\)-invariant 0 ⋮ Updating key size estimations for pairings ⋮ TNFS resistant families of pairing-friendly elliptic curves ⋮ Indifferentiable hashing to ordinary elliptic \(\mathbb{F}_{q} \)-curves of \(j=0\) with the cost of one exponentiation in \(\mathbb{F}_{q} \)

This page was built for publication: Guide to Pairing-Based Cryptography