A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves
Mathematics of Computation
Algebraic aspects of cryptography
Algebraic aspects of cryptography
Mathematics of Computation
On the discrete logarithm in the divisor class group of curves
Mathematics of Computation
Computing discrete logarithms in real quadratic congruence function fields of large genus
Mathematics of Computation
Efficient Arithmetic on Koblitz Curves
Designs, Codes and Cryptography - Special issue on towards a quarter-century of public key cryptography
Elliptic curves in cryptography
Elliptic curves in cryptography
Analysis of the Weil Descent Attack of Gaudry, Hess and Smart
CT-RSA 2001 Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA
Speeding up the Arithmetic on Koblitz Curves of Genus Two
SAC '00 Proceedings of the 7th Annual International Workshop on Selected Areas in Cryptography
Algorithms for Multi-exponentiation
SAC '01 Revised Papers from the 8th Annual International Workshop on Selected Areas in Cryptography
Faster Point Multiplication on Elliptic Curves with Efficient Endomorphisms
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
CM-Curves with Good Cryptographic Properties
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Efficient Multiplication on Certain Nonsupersingular Elliptic Curves
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
An Improved Algorithm for Arithmetic on a Family of Elliptic Curves
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
Speeding up the Discrete Log Computation on Curves with Automorphisms
ASIACRYPT '99 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
An Alternate Decomposition of an Integer for Faster Point Multiplication on Certain Elliptic Curves
PKC '02 Proceedings of the 5th International Workshop on Practice and Theory in Public Key Cryptosystems: Public Key Cryptography
ANTS-I Proceedings of the First International Symposium on Algorithmic Number Theory
An algorithm for solving the discrete log problem on hyperelliptic curves
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
SAC '02 Revised Papers from the 9th Annual International Workshop on Selected Areas in Cryptography
Pairing '08 Proceedings of the 2nd international conference on Pairing-Based Cryptography
Efficiently computable endomorphisms for hyperelliptic curves
ANTS'06 Proceedings of the 7th international conference on Algorithmic Number Theory
New families of hyperelliptic curves with efficient gallant-lambert-vanstone method
ICISC'04 Proceedings of the 7th international conference on Information Security and Cryptology
Counting points on genus 2 curves with real multiplication
ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
Finite Fields and Their Applications
High-Performance scalar multiplication using 8-dimensional GLV/GLS decomposition
CHES'13 Proceedings of the 15th international conference on Cryptographic Hardware and Embedded Systems
| Hi-index | 0.00 |
As Koblitz curves were generalized to hyperelliptic Koblitz curves for faster point multiplication by G眉nter, et al. [10] we extend the recent work of Gallant, et al. [8] to hyperelliptic curves. So the extended method for speeding point multiplication applies to a much larger family of hyperelliptic curves over finite fields that have efficiently-computable endomorphisms. For this special family of curves, a speedup of up to 55 (59) % can be achieved over the best general methods for a 160-bit point multiplication in case of genus g =2 (3).