%0 Journal Article
%T Fast Arithmetic of Genus 3 Hyperelliptic Curves over Prime Fields<br>素数域上亏格为3的超椭圆曲线快速算法
%A HAO Yan-Hua
%A TAN Shi-Chong
%A WANG Yu-Min
%A <br>郝艳华
%A 谭示崇
%A 王育民
%J 计算机科学
%D 2006
%I 
%X Explicit formulae for addition and doubling on genus 3 hyperelliptic curve over prime fields using degenerate divisors are presented, which can be applied to scalar multiplications of hyperelliptic curve cryptosystems with a fixed base point, e. g. , ElGamal-type encryption, the sender of Diffie-Hellman and HECDSA. Compared with scalar multiplications using standard divisors, the proposed scheme using degenerate divisors of degree 1 or 2 can attain a speed-up of approximately 33.4% and 16. 7%, respectively. At the same time, the representation of the base point can be compressed to one third or two thirds of standard divisors.
%K Genus 3 hyperelliptic curves
%K Explicit formula
%K Scalar multiplication
%K Degenerate divisor<br>亏格为3的超椭圆曲线
%K 确定性公式
%K 标量乘
%K 退化除子
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=64A12D73428C8B8DBFB978D04DFEB3C1&aid=E937D29437B62358&yid=37904DC365DD7266&vid=27746BCEEE58E9DC&iid=F3090AE9B60B7ED1&sid=656F8C8401D91023&eid=CFAC5CB624A41AFD&journal_id=1002-137X&journal_name=计算机科学&referenced_num=0&reference_num=10