Efficient implementation of pairing-based cryptosystems

DOI10.1007/S00145-004-0311-ZMaRDI QIDQ1772224zbMATH OpenOpenAlexFDO

Authors Xianqiang Yang, Paulo S. L. M. Barreto, Ben Lynn, Michael Scott

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

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

Recommendations

• Efficient algorithms for pairing-based cryptosystems
• The realm of the pairings
• Algorithmic Number Theory
• Cryptography and Coding
• Constructing elliptic curves with prescribed embedding degrees

Cited in

(37)

• Efficient \(p\)th root computations in finite fields of characteristic \(p\)
• On the relationship between squared pairings and plain pairings
• Scalable zero knowledge via cycles of elliptic curves
• Parallelizing pairings on Hessian elliptic curves
• Efficient optimal ate pairing at 128-bit security level
• LOVE a pairing
• Designing efficient dyadic operations for cryptographic applications
• A taxonomy of pairing-friendly elliptic curves
• On cryptographic protocols employing asymmetric pairings -- the role of \(\Psi \) revisited
• Efficient pairing computation on supersingular abelian varieties
• Faster computation of the Tate pairing
• Tower building technique on elliptic curve with embedding degree 18
• Generation and Tate pairing computation of ordinary elliptic curves with embedding degree one
• Subgroup security in pairing-based cryptography
• The realm of the pairings
• Elliptic curves with j=0,1728 and low embedding degree
• RNS arithmetic in \(\mathbb F_{p^{k}}\) and application to fast pairing computation
• An analysis of affine coordinates for pairing computation
• On the efficient implementation of pairing-based protocols
• Faster Pairings on Special Weierstrass Curves
• Constructing tower extensions of finite fields for implementation of pairing-based cryptography
• Efficient algorithms for pairing-based cryptosystems
• On efficient pairings on elliptic curves over extension fields
• Huff's model for elliptic curves
• Advances in Cryptology – CRYPTO 2004
• Faster Pairings Using an Elliptic Curve with an Efficient Endomorphism
• EFFICIENT PAIRING FUNCTIONS — AND WHY YOU SHOULD CARE
• Selected Areas in Cryptography
• Fast symmetric pairing revisited
• Cryptography and Coding
• Algorithmic Number Theory
• Algebraic curves and cryptography
• Secure and Efficient Pairing at 256-Bit Security Level
• Fuzzy perspective of online games by using cryptography and cooperative game theory
• Effective pairings in isogeny-based cryptography
• The Tate profile
• On computable isomorphisms in efficient asymmetric pairing-based systems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1772224)