Algorithmic Number Theory

DOI10.1007/11792086zbMath1143.14312arXivmath/0603505OpenAlexW2977481208WikidataQ29400612 ScholiaQ29400612MaRDI QIDQ5899271

David R. Kohel, Benjamin Andrew Smith

Publication date: 2 May 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0603505

zbMATH Keywords

hyperelliptic curve cryptographyefficiently computable endomorphisms

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Finite ground fields in algebraic geometry (14G15) Computational aspects of algebraic curves (14Q05) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (7)

Fast cryptography in genus 2 ⋮ Ready-made short basis for GLV+GLS on high degree twisted curves ⋮ The \(\mathbb Q\)-curve construction for endomorphism-accelerated elliptic curves ⋮ Counting points on genus-3 hyperelliptic curves with explicit real multiplication ⋮ Counting points on hyperelliptic curves of type \(y^2=x^{2g+1}+ax^{g+1}+bx\) ⋮ Counting points on hyperelliptic curves with explicit real multiplication in arbitrary genus ⋮ On certain maximal hyperelliptic curves related to Chebyshev polynomials

This page was built for publication: Algorithmic Number Theory