Fast Endomorphism for Hyperelliptic Cryptosystem
In EUROCRYPT 2009 Galbraith, Lin and Scott constructed an efficiently computable endomorphism for faster elliptic curve cryptosystem for a large family of elliptic curves defined over finite fields of large characteristic.In this paper we extend the construction to any genus 2 hyperelliptic curve defined over a finite field of even characteristic.We propose an efficient algorithm to generate a random genus 2 hyperelliptic curve and its quadratic twist equipped with a fast endomorphism on the Jacobian.The analysis of the scalar multiplication amount is also given.
hyperelliptic cryptosystem Jacobian scalar multiplication efficiently computable endomorphism
Lei Li Siman Yang
Department of Mathematics, East China Normal University,Shanghai 200241, P.R.China
国内会议
长沙
英文
149-158
2011-10-15(万方平台首次上网日期,不代表论文的发表时间)