Eta Pairing Computation on General Divisors over Hyperelliptic Curves y 2 = x 7 − x ±1

DOI10.1007/978-3-540-73489-5_20zbMath1151.94533OpenAlexW1761732174MaRDI QIDQ5429250

Hyang-Sook Lee, Yoon-Jin Lee, Eun Jeong Lee

Publication date: 29 November 2007

Published in: Pairing-Based Cryptography – Pairing 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73489-5_20

zbMATH Keywords

hyperelliptic curvesresultantdivisorsTate pairingpairing-based cryptosystemEta pairing

Mathematics Subject Classification ID

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

Related Items (2)

Speeding Up Pairing Computations on Genus 2 Hyperelliptic Curves with Efficiently Computable Automorphisms ⋮ Efficient Pairing Computation on Genus 2 Curves in Projective Coordinates

This page was built for publication: Eta Pairing Computation on General Divisors over Hyperelliptic Curves y 2 = x 7 − x ±1