Advances in Cryptology – CRYPTO 2004

DOI10.1007/B99099zbMATH Open1104.94036DBLPconf/crypto/2004OpenAlexW2477011922MaRDI QIDQ5311564FDOQ5311564

Authors:

Publication date: 23 August 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b99099

Recommendations

• On Compressible Pairings and Their Computation
• Compression of Tate pairings on elliptic curves
• Factor-4 and 6 (De)Compression for Values of Pairings Using Trace Maps
• The realm of the pairings
• Efficient implementation of pairing-based cryptosystems

zbMATH Keywords

efficient implementationpairing-based cryptosystem

Mathematics Subject Classification ID

Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71)

Cited In (22)

• Compression of Tate pairings on elliptic curves
• Computing pairings using \(x\)-coordinates only
• Effective compression maps for torus-based cryptography
• Speeding Up Pairing Computations on Genus 2 Hyperelliptic Curves with Efficiently Computable Automorphisms
• Memory-saving computation of the pairing final exponentiation on BN curves
• Choosing and generating parameters for pairing implementation on BN curves
• On hardware and software implementation of arithmetic in finite fields of characteristic 7 for calculation of pairings
• Improving the computation of the optimal ate pairing for a high security level
• Factor-4 and 6 compression of cyclotomic subgroups of \(\mathbb F^*_{2^{4m}}\) and \(\mathbb F^*_{3^{6m}}\)
• A taxonomy of pairing-friendly elliptic curves
• Faster beta Weil pairing on BLS pairing friendly curves with odd embedding degree
• Attractive subfamilies of BLS curves for implementing high-security pairings
• Efficient pairing computation on supersingular abelian varieties
• On Compressible Pairings and Their Computation
• Factor-4 and 6 (De)Compression for Values of Pairings Using Trace Maps
• On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves
• Pairing Lattices
• Selecting Complementary Pairs of Literals
• Compressed M-SIDH: an instance of compressed SIDH-like schemes with isogenies of highly composite degrees
• Exponentiating in pairing groups
• Effective pairings in isogeny-based cryptography
• Compressions of compact tuples

This page was built for publication: Advances in Cryptology – CRYPTO 2004

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