Efficient and Generalized Pairing Computation on Abelian Varieties

DOI10.1109/TIT.2009.2013048zbMath1367.14021OpenAlexW2153726795MaRDI QIDQ4975817

Cheol-Min Park, Hyang-Sook Lee, Eun Jeong Lee

Publication date: 8 August 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2009.2013048

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Computational aspects of higher-dimensional varieties (14Q15) Finite ground fields in algebraic geometry (14G15) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (25)

Faster Hashing to ${\mathbb G}_2$ ⋮ Self-pairings on supersingular elliptic curves with embedding degree \textit{three} ⋮ On Compressible Pairings and Their Computation ⋮ 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 ⋮ Faster pairing computation on genus \(2\) hyperelliptic curves ⋮ Optimal pairing computation over families of pairing-friendly elliptic curves ⋮ Maximum gap in (inverse) cyclotomic polynomial ⋮ An Improvement of Optimal Ate Pairing on KSS Curve with Pseudo 12-Sparse Multiplication ⋮ Maximum gap in cyclotomic polynomials ⋮ Fixed argument pairing inversion on elliptic curves ⋮ Choosing and generating parameters for pairing implementation on BN curves ⋮ RNS arithmetic in 𝔽 pk and application to fast pairing computation ⋮ Efficient Self-pairing on Ordinary Elliptic Curves ⋮ Comparing two pairing-based aggregate signature schemes ⋮ On cryptographic protocols employing asymmetric pairings -- the role of \(\Psi \) revisited ⋮ Integer Variable χ–Based Ate Pairing ⋮ An Analysis of Affine Coordinates for Pairing Computation ⋮ Polynomial generating pairing and its criterion for optimal pairing ⋮ Generating Pairing-Friendly Curves with the CM Equation of Degree 1 ⋮ Cryptographic Pairings Based on Elliptic Nets ⋮ Parallelizing the Weil and Tate Pairings ⋮ On the Efficient Implementation of Pairing-Based Protocols ⋮ Computing fixed argument pairings with the elliptic net algorithm ⋮ Explicit formula for optimal ate pairing over cyclotomic family of elliptic curves

This page was built for publication: Efficient and Generalized Pairing Computation on Abelian Varieties