Faster pairing computation on genus \(2\) hyperelliptic curves
type: Item
instance of: scholarly article
title: Faster pairing computation on genus \(2\) hyperelliptic curves
zbMATH Open document ID: 1260.94057
author: Yanfeng Qi
author: Chun-Ming Tang
author: Maozhi Xu
published in: Information Processing Letters
publication date: 2013-03-28T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 6149213
zbMATH Keywords: cryptography
zbMATH Keywords: genus-\(2\) hyperelliptic curves
zbMATH Keywords: pairing-based cryptography
zbMATH Keywords: efficiently computable endomorphisms
zbMATH Keywords: pairing computation
describes a project that uses: Magma
MaRDI profile type: Publication
full work available at URL: j.ipl.2011.02.011
OpenAlex ID: W2047092919
cites work: Handbook of Elliptic and Hyperelliptic Curve Cryptography
cites work: Efficient pairing computation on supersingular abelian varieties
cites work: Q4783728
cites work: The Magma algebra system. I: The user language
cites work: Computing in the Jacobian of a Hyperelliptic Curve
cites work: An Identity-Based Signature from Gap Diffie-Hellman Groups
cites work: Information Security and Cryptology - ICISC 2003
cites work: Advances in Cryptology - ASIACRYPT 2003
cites work: Speeding Up Pairing Computations on Genus 2 Hyperelliptic Curves with Efficiently Computable Automorphisms
cites work: Efficient Pairing Computation on Genus 2 Curves in Projective Coordinates
cites work: A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves
cites work: Hyperelliptic Pairings
cites work: Ate Pairing on Hyperelliptic Curves
cites work: Pairing Lattices
cites work: The Eta Pairing Revisited
cites work: Q2739458
cites work: Hyperelliptic cryptosystems
cites work: Efficient and Generalized Pairing Computation on Abelian Varieties
cites work: Reducing elliptic curve logarithms to logarithms in a finite field
cites work: The Weil pairing, and its efficient calculation
cites work: Identity-based authenticated key agreement protocol based on Weil pairing
cites work: Optimal Pairings
DOI: 10.1016/J.IPL.2011.02.011
description: scientific article; zbMATH DE number 6149213