Algorithmic Number Theory

DOI10.1007/11792086MaRDI QIDQ5899271zbMATH OpenOpenAlexFDO

Authors David 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

efficiently computable endomorphismshyperelliptic curve cryptography

Mathematics Subject Classification ID

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

Abstract: Elliptic curves have a well-known and explicit theory for the construction and application of endomorphisms, which can be applied to improve performance in scalar multiplication. Recent work has extended these techniques to hyperelliptic Jacobians, but one obstruction is the lack of explicit models of curves together with an efficiently computable endomorphism. In the case of hyperelliptic curves there are limited examples, most methods focusing on special CM curves or curves defined over a small field. In this article we describe three infinite families of curves which admit an efficiently computable endomorphism, and give algorithms for their efficient application.

Recommendations

• Efficiently computable endomorphism for genus 3 hyperelliptic curve cryptosystems
• scientific article; zbMATH DE number 2086707
• Endomorphisms for faster elliptic curve cryptography on a large class of curves
• Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves
• Efficient computable homomorphisms on Hessian curves

Cited in

(16)

• Counting points on hyperelliptic curves of type \(y^2=x^{2g+1}+ax^{g+1}+bx\)
• Ready-made short basis for GLV+GLS on high degree twisted curves
• Counting points on hyperelliptic curves with explicit real multiplication in arbitrary genus
• On certain maximal hyperelliptic curves related to Chebyshev polynomials
• Fast cryptography in genus 2
• The Q-curve construction for endomorphism-accelerated elliptic curves
• Efficiently computable endomorphism for genus 3 hyperelliptic curve cryptosystems
• Rigorous computation of the endomorphism ring of a Jacobian
• scientific article; zbMATH DE number 2086707 (Why is no real title available?)
• scientific article; zbMATH DE number 1860727 (Why is no real title available?)
• Construction of endomorphisms for the ISD method on elliptic curves with j-invariant 1728
• Constructions of elliptic curves endomorphisms
• Computing endomorphism rings of supersingular elliptic curves and connections to path-finding in isogeny graphs
• Efficient computable homomorphisms on Hessian curves
• Counting points on genus-3 hyperelliptic curves with explicit real multiplication
• On certain maximal curves related to Chebyshev polynomials

This page was built for publication: Algorithmic Number Theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5899271)