The Weil pairing, and its efficient calculation
From MaRDI portal
Publication:1772231
DOI10.1007/s00145-004-0315-8zbMath1078.14043OpenAlexW1990220158MaRDI QIDQ1772231
Publication date: 15 April 2005
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-004-0315-8
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Elliptic curves (14H52) Curves over finite and local fields (11G20) Computational aspects of algebraic curves (14Q05) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Related Items (93)
Pairing-based cryptography on elliptic curves ⋮ Faster Hashing to ${\mathbb G}_2$ ⋮ Optimal Eta Pairing on Supersingular Genus-2 Binary Hyperelliptic Curves ⋮ Faster Ate pairing computation on Selmer's model of elliptic curves ⋮ Identity based group key agreement in multiple PKG environment ⋮ Idetity based group key agreement from bilinear pairing ⋮ Computing isogenies between abelian varieties ⋮ Further refinements of Miller's algorithm on Edwards curves ⋮ Multibase scalar multiplications in cryptographic pairings ⋮ Pairing Computation on Edwards Curves with High-Degree Twists ⋮ Efficient Implementation of Bilinear Pairings on ARM Processors ⋮ CRT-Based Outsourcing Algorithms for Modular Exponentiations ⋮ LOVE a pairing ⋮ Unconditionally anonymous ring and mesh signatures ⋮ A Leakage Resilient MAC ⋮ Faster beta Weil pairing on BLS pairing friendly curves with odd embedding degree ⋮ Chosen ciphertext secure authenticated group communication using identity-based signcryption ⋮ Computing functions on Jacobians and their quotients ⋮ Failure of the Point Blinding Countermeasure Against Fault Attack in Pairing-Based Cryptography ⋮ Quantum attribute-based encryption: a comprehensive study ⋮ Self-pairings on supersingular elliptic curves with embedding degree \textit{three} ⋮ A survey of fault attacks in pairing based cryptography ⋮ Individual discrete logarithm with sublattice reduction ⋮ AN ANALYTIC PERSPECTIVE OF WEIL RECIPROCITY ⋮ Short signatures without random oracles and the SDH assumption in bilinear groups ⋮ Fast hashing to \(\mathbb{G}_2\) on pairing-friendly curves with the lack of twists ⋮ Weak instances of class group action based cryptography via self-pairings ⋮ Spreading alerts quietly and the subgroup escape problem ⋮ A survey on functional encryption ⋮ New versions of Miller-loop secured against side-channel attacks ⋮ Computing bilinear pairings on elliptic curves with automorphisms ⋮ Simple and exact formula for minimum loop length in \(\mathrm{Ate}_{i }\) pairing based on Brezing-Weng curves ⋮ Identity-based chameleon hashing and signatures without key exposure ⋮ Faster pairing computation on genus \(2\) hyperelliptic curves ⋮ Elliptic curve cryptography: the serpentine course of a paradigm shift ⋮ Finding composite order ordinary elliptic curves using the Cocks-Pinch method ⋮ Faster computation of the Tate pairing ⋮ Elliptic curve discrete logarithm problem over small degree extension fields ⋮ Optimal pairing computation over families of pairing-friendly elliptic curves ⋮ Heuristics of the Cocks-Pinch method ⋮ Security weaknesses of a signature scheme and authenticated key agreement protocols ⋮ The pairing computation on Edwards curves ⋮ A Weil pairing on the \(p\)-torsion of ordinary elliptic curves over \(K[\varepsilon\)] ⋮ Efficient selective identity-based encryption without random oracles ⋮ Closed formulae for the Weil pairing inversion ⋮ ON BOUNDS FOR BALANCED EMBEDDING DEGREE ⋮ Fixed argument pairing inversion on elliptic curves ⋮ Choosing and generating parameters for pairing implementation on BN curves ⋮ Finding the group structure of elliptic curves over finite fields ⋮ RNS arithmetic in 𝔽 pk and application to fast pairing computation ⋮ Pairing the volcano ⋮ An optimal representation for the trace zero subgroup ⋮ Tate and Ate pairings for \(y^2=x^5-\alpha x\) in characteristic five ⋮ Algebraic curves and cryptography ⋮ Efficient Self-pairing on Ordinary Elliptic Curves ⋮ Constraining Pseudorandom Functions Privately ⋮ Efficient Compression of SIDH Public Keys ⋮ Elliptic curves in Huff’s model ⋮ Updating key size estimations for pairings ⋮ Huff’s Model for Elliptic Curves ⋮ A taxonomy of pairing-friendly elliptic curves ⋮ Compact Group Signatures Without Random Oracles ⋮ Pairing Lattices ⋮ The Hidden Root Problem ⋮ Pairing Computation on Twisted Edwards Form Elliptic Curves ⋮ Speeding Up Pairing Computations on Genus 2 Hyperelliptic Curves with Efficiently Computable Automorphisms ⋮ A Comparison between Hardware Accelerators for the Modified Tate Pairing over $\mathbb{F}_{2^m}$ and $\mathbb{F}_{3^m}$ ⋮ Identity-based trapdoor mercurial commitments and applications ⋮ An Analysis of Affine Coordinates for Pairing Computation ⋮ Signatures in hierarchical certificateless cryptography: efficient constructions and provable security ⋮ Optimised Versions of the Ate and Twisted Ate Pairings ⋮ Low-cost addition-subtraction sequences for the final exponentiation in pairings ⋮ Pairing-based algorithms for Jacobians of genus 2 curves with maximal endomorphism ring ⋮ A generalisation of Miller's algorithm and applications to pairing computations on abelian varieties ⋮ Polynomial generating pairing and its criterion for optimal pairing ⋮ Hensel-lifting torsion points on Jacobians and Galois representations ⋮ On bilinear structures on divisor class groups ⋮ What about Vulnerability to a Fault Attack of the Miller’s Algorithm During an Identity Based Protocol? ⋮ Faster Pairings on Special Weierstrass Curves ⋮ Cryptographic Pairings Based on Elliptic Nets ⋮ Beta Weil pairing revisited ⋮ Improving the computation of the optimal ate pairing for a high security level ⋮ Parallelizing the Weil and Tate Pairings ⋮ Efficient Pairing Computation on Ordinary Elliptic Curves of Embedding Degree 1 and 2 ⋮ Attractive Subfamilies of BLS Curves for Implementing High-Security Pairings ⋮ Explicit $n$-descent on elliptic curves III. Algorithms ⋮ Isogeny graphs with maximal real multiplication ⋮ Computing fixed argument pairings with the elliptic net algorithm ⋮ The optimal ate pairing over the Barreto-Naehrig curve via parallelizing elliptic nets ⋮ Another Approach to Pairing Computation in Edwards Coordinates ⋮ Explicit formula for optimal ate pairing over cyclotomic family of elliptic curves ⋮ A Brief History of Pairings ⋮ Adequate Elliptic Curves for Computing the Product of n Pairings
This page was built for publication: The Weil pairing, and its efficient calculation
