Advances in Cryptology – CRYPTO 2004

DOI10.1007/b99099zbMath1104.94036OpenAlexW2477011922WikidataQ27980744 ScholiaQ27980744MaRDI QIDQ5311564

No author found.

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

zbMATH Keywords

efficient implementationpairing-based cryptosystem

Mathematics Subject Classification ID

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

Related Items (13)

Effective compression maps for torus-based cryptography ⋮ Memory-saving computation of the pairing final exponentiation on BN curves ⋮ Efficient pairing computation on supersingular abelian varieties ⋮ Faster beta Weil pairing on BLS pairing friendly curves with odd embedding degree ⋮ On Compressible Pairings and Their Computation ⋮ On hardware and software implementation of arithmetic in finite fields of characteristic 7 for calculation of pairings ⋮ Choosing and generating parameters for pairing implementation on BN curves ⋮ A taxonomy of pairing-friendly elliptic curves ⋮ Speeding Up Pairing Computations on Genus 2 Hyperelliptic Curves with Efficiently Computable Automorphisms ⋮ Computing pairings using \(x\)-coordinates only ⋮ On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves ⋮ Improving the computation of the optimal ate pairing for a high security level ⋮ Attractive Subfamilies of BLS Curves for Implementing High-Security Pairings

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