Constructing Pairing-Friendly Genus 2 Curves with Ordinary Jacobians
From MaRDI portal
Publication:5429237
DOI10.1007/978-3-540-73489-5_9zbMath1151.11354MaRDI 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
11T71: Algebraic coding theory; cryptography (number-theoretic aspects)
94A60: Cryptography
11Y16: Number-theoretic algorithms; complexity
14G50: Applications to coding theory and cryptography of arithmetic geometry
Related Items
ON BOUNDS FOR BALANCED EMBEDDING DEGREE, Generating pairing-friendly parameters for the CM construction of genus 2 curves over prime fields, A taxonomy of pairing-friendly elliptic curves, A CM construction for curves of genus 2 with \(p\)-rank 1, A New Method for Constructing Pairing-Friendly Abelian Surfaces, Efficiently Computable Distortion Maps for Supersingular 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, Efficient Pairing Computation on Genus 2 Curves in Projective Coordinates