Efficient and Generalized Pairing Computation on Abelian Varieties
From MaRDI portal
Publication:4975817
DOI10.1109/TIT.2009.2013048zbMath1367.14021MaRDI 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)
11T71: Algebraic coding theory; cryptography (number-theoretic aspects)
94A60: Cryptography
14Q15: Computational aspects of higher-dimensional varieties
14G15: Finite ground fields in algebraic geometry
14G50: Applications to coding theory and cryptography of arithmetic geometry
Related Items
Efficient Self-pairing on Ordinary Elliptic Curves, Self-pairings on supersingular elliptic curves with embedding degree \textit{three}, Optimal pairing computation over families of pairing-friendly elliptic curves, Maximum gap in (inverse) cyclotomic polynomial, Fixed argument pairing inversion on elliptic curves, Computing bilinear pairings on elliptic curves with automorphisms, Polynomial generating pairing and its criterion for optimal pairing, Comparing two pairing-based aggregate signature schemes, Choosing and generating parameters for pairing implementation on BN curves, 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, Maximum gap in cyclotomic polynomials, On cryptographic protocols employing asymmetric pairings -- the role of \(\Psi \) revisited, Explicit formula for optimal ate pairing over cyclotomic family of elliptic curves, Faster Hashing to ${\mathbb G}_2$, An Improvement of Optimal Ate Pairing on KSS Curve with Pseudo 12-Sparse Multiplication, RNS arithmetic in 𝔽 pk and application to fast pairing computation, An Analysis of Affine Coordinates for Pairing Computation, 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, Generating Pairing-Friendly Curves with the CM Equation of Degree 1, On Compressible Pairings and Their Computation, Integer Variable χ–Based Ate Pairing
