Secure hyperelliptic cryptosystems and their performance
From MaRDI portal
Recommendations
Cited in
(20)- Hyperelliptic cryptosystems
- Selection of secure hyperelliptic curves of \textit{g=2} based on a subfield
- Pell hyperbolas in DLP-based cryptosystems
- On the security of generalized Jacobian cryptosystems
- scientific article; zbMATH DE number 1583784 (Why is no real title available?)
- How to construct efficient signcryption schemes on elliptic curves
- Hyperelliptic curves for the vector decomposition problem over fields of even characteristic
- An algorithm for solving the discrete log problem on hyperelliptic curves
- Hyperelliptic curves encryption combined with block codes for Gaussian channel
- On the performance of hyperelliptic cryptosystems
- Efficient construction of secure hyperelliptic discrete logarithm problems
- scientific article; zbMATH DE number 1992750 (Why is no real title available?)
- scientific article; zbMATH DE number 2048532 (Why is no real title available?)
- Hyperelliptic Curve Cryptosystems: Closing the Performance Gap to Elliptic Curves
- Elliptic and hyperelliptic curves: a practical security analysis
- Invalid-curve attacks on (hyper)elliptic curve cryptosystems
- scientific article; zbMATH DE number 4185800 (Why is no real title available?)
- The extended Euclidean algorithm on polynomials, and the computational efficiency of hyperelliptic cryptosystems
- Cryptographic protocols on real hyperelliptic curves
- A Family of Subfield Hyperelliptic Curves for Use in Cryptography
This page was built for publication: Secure hyperelliptic cryptosystems and their performance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3840091)
