Aspects of hyperelliptic curves over large prime fields in software implementations
From MaRDI portal
Recommendations
- Rethinking low genus hyperelliptic Jacobian arithmetic over binary fields: interplay of field arithmetic and explicit formulæ
- Hyperelliptic Curve Cryptosystems: Closing the Performance Gap to Elliptic Curves
- Efficient Explicit Formulae for Genus 2 Hyperelliptic Curves over Prime Fields and Their Implementations
- Over \(F_p\) vs. over \(F_{2^n}\) and on Pentium vs. on Alpha in software implementation of hyperelliptic curve cryptosystems
- Formulae for arithmetic on genus 2 hyperelliptic curves
Cited in
(12)- Constructive and destructive use of compilers in elliptic curve cryptography
- Group arithmetic in \(C_{3,5}\) curves
- Multibase scalar multiplications in cryptographic pairings
- Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves
- Genus two hyperelliptic curve coprocessor
- Over \(F_p\) vs. over \(F_{2^n}\) and on Pentium vs. on Alpha in software implementation of hyperelliptic curve cryptosystems
- Endomorphisms for faster elliptic curve cryptography on a large class of curves
- scientific article; zbMATH DE number 1748068 (Why is no real title available?)
- Elliptic and hyperelliptic curves: a practical security analysis
- Extractors for Jacobian of Hyperelliptic Curves of Genus 2 in Odd Characteristic
- Efficient Explicit Formulae for Genus 2 Hyperelliptic Curves over Prime Fields and Their Implementations
- Algebraic curves and cryptography
This page was built for publication: Aspects of hyperelliptic curves over large prime fields in software implementations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5311431)
