Use of elliptic curves in cryptography
Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
Journal of Cryptology
Algebraic aspects of cryptography
Algebraic aspects of cryptography
Elliptic curves in cryptography
Elliptic curves in cryptography
Design of Hyperelliptic Cryptosystems in Small Characteristic and a Software Implementation over F2n
ASIACRYPT '98 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
Secure Hyperelliptic Cryptosystems and Their Performances
PKC '98 Proceedings of the First International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
On the performance of hyperelliptic cryptosystems
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
| Hi-index | 0.00 |
Hyperelliptic curve cryptosystems (HCC for short) is a generalization of ECC. It has been drawing the attention of more and more researchers in recent years. The problem of how to decrease the amount of addition and scalar multiplication on the Jacobians of hyperelliptic curves so that the implementation speed can be improved is very important for the practical use of HCC. In this paper, Using Frobenius endomorphism as a tool, we discuss the problem of faster scalar multiplication. A faster algorithm on Jacobian's scalar multiplication of a family of specific hyperelliptic curves is proposed with its computational cost analyzed. Analysis reveals that our algorithms's computational cost is less than that of Signed Binary Method.