Efficient implementation of pairing-based cryptosystems

DOI10.1007/s00145-004-0311-zzbMath1123.94334OpenAlexW2028372707MaRDI QIDQ1772224

Xianqiang Yang

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-0311-z

Mathematics Subject Classification ID

Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (16)

LOVE a pairing ⋮ Efficient pairing computation on supersingular abelian varieties ⋮ Subgroup Security in Pairing-Based Cryptography ⋮ Scalable zero knowledge via cycles of elliptic curves ⋮ Elliptic curves withj= 0,1728 and low embedding degree ⋮ Faster computation of the Tate pairing ⋮ Parallelizing pairings on Hessian elliptic curves ⋮ RNS arithmetic in 𝔽 pk and application to fast pairing computation ⋮ Algebraic curves and cryptography ⋮ Huff’s Model for Elliptic Curves ⋮ On cryptographic protocols employing asymmetric pairings -- the role of \(\Psi \) revisited ⋮ An Analysis of Affine Coordinates for Pairing Computation ⋮ Efficient \(p\)th root computations in finite fields of characteristic \(p\) ⋮ Faster Pairings on Special Weierstrass Curves ⋮ On the Efficient Implementation of Pairing-Based Protocols ⋮ On the relationship between squared pairings and plain pairings

This page was built for publication: Efficient implementation of pairing-based cryptosystems