Constructing Pairing-Friendly Genus 2 Curves with Ordinary Jacobians

DOI10.1007/978-3-540-73489-5_9zbMath1151.11354OpenAlexW2118923729MaRDI QIDQ5429237

No author found.

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_9

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (10)

Efficiently Computable Distortion Maps for Supersingular Curves ⋮ A CM construction for curves of genus 2 with \(p\)-rank 1 ⋮ Generating pairing-friendly parameters for the CM construction of genus 2 curves over prime fields ⋮ ON BOUNDS FOR BALANCED EMBEDDING DEGREE ⋮ A taxonomy of pairing-friendly elliptic curves ⋮ Homomorphic Encryption and Signatures from Vector Decomposition ⋮ Pairing-Friendly Hyperelliptic Curves with Ordinary Jacobians of Type y 2 = x 5 + ax ⋮ Speeding Up Pairing Computations on Genus 2 Hyperelliptic Curves with Efficiently Computable Automorphisms ⋮ A New Method for Constructing Pairing-Friendly Abelian Surfaces ⋮ Efficient Pairing Computation on Genus 2 Curves in Projective Coordinates

This page was built for publication: Constructing Pairing-Friendly Genus 2 Curves with Ordinary Jacobians