Efficiently computable endomorphism for genus 3 hyperelliptic curve cryptosystems
From MaRDI portal
(Redirected from Publication:396609)
Recommendations
Cites work
- scientific article; zbMATH DE number 1951602 (Why is no real title available?)
- scientific article; zbMATH DE number 2086707 (Why is no real title available?)
- scientific article; zbMATH DE number 1842492 (Why is no real title available?)
- Analyzing the Galbraith-Lin-Scott Point Multiplication Method for Elliptic Curves over Binary Fields
- Computing in the Jacobian of a Hyperelliptic Curve
- Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves
- Endomorphisms for faster elliptic curve cryptography on a large class of curves
- Handbook of Elliptic and Hyperelliptic Curve Cryptography
- Hyperelliptic cryptosystems
- Isomorphism classes of hyperelliptic curves of genus 3 over finite fields
Cited in
(4)
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)