Efficiently computable endomorphism for genus 3 hyperelliptic curve cryptosystems

DOI10.1016/j.ipl.2013.03.014zbMath1358.94061OpenAlexW2068799693MaRDI QIDQ396609

Jun Feng, Hong Sun, Xue-Ming Wang

Publication date: 13 August 2014

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2013.03.014

zbMATH Keywords

cryptographyscalar multiplicationgenus 3 hyperelliptic curvesefficiently computable endomorphism

Mathematics Subject Classification ID

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

Related Items

Privacy-preserving computation in cyber-physical-social systems: a survey of the state-of-the-art and perspectives ⋮ Jo-DPMF: differentially private matrix factorization learning through joint optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Endomorphisms for faster elliptic curve cryptography on a large class of curves
• Hyperelliptic cryptosystems
• Isomorphism classes of hyperelliptic curves of genus 3 over finite fields
• Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves
• Computing in the Jacobian of a Hyperelliptic Curve
• Analyzing the Galbraith-Lin-Scott Point Multiplication Method for Elliptic Curves over Binary Fields
• Handbook of Elliptic and Hyperelliptic Curve Cryptography

This page was built for publication: Efficiently computable endomorphism for genus 3 hyperelliptic curve cryptosystems