Efficiently computable endomorphism for genus 3 hyperelliptic curve cryptosystems
DOI10.1016/J.IPL.2013.03.014zbMATH Open1358.94061OpenAlexW2068799693MaRDI QIDQ396609FDOQ396609
Xueming Wang, Jun Feng, Hong Sun
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
Recommendations
Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Cites Work
- Computing in the Jacobian of a Hyperelliptic Curve
- Endomorphisms for faster elliptic curve cryptography on a large class of curves
- Title not available (Why is that?)
- Title not available (Why is that?)
- Handbook of Elliptic and Hyperelliptic Curve Cryptography
- Title not available (Why is that?)
- 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
- Analyzing the Galbraith-Lin-Scott Point Multiplication Method for Elliptic Curves over Binary Fields
Cited In (3)
This page was built for publication: Efficiently computable endomorphism for genus 3 hyperelliptic curve cryptosystems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q396609)