TY - GEN
T1 - Speeding up point multiplication on hyperelliptic curves with efficiently-computable endomorphisms
AU - Park, Young Ho
AU - Jeong, Sangtae
AU - Lim, Jong In
PY - 2002
Y1 - 2002
N2 - As Koblitz curves were generalized to hyperelliptic Koblitz curves for faster point multiplication by Güunter, 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).
AB - As Koblitz curves were generalized to hyperelliptic Koblitz curves for faster point multiplication by Güunter, 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).
UR - http://www.scopus.com/inward/record.url?scp=84947275198&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84947275198&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:84947275198
SN - 9783540435532
VL - 2332
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 197
EP - 208
BT - Advances in Cryptology - EUROCRYPT 2002 - International Conference on the Theory and Applications of Cryptographic Techniques, 2002, Proceedings
PB - Springer Verlag
T2 - International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2002
Y2 - 28 April 2002 through 2 May 2002
ER -