A simple method to obtain relations among factor basis elements for special hyperelliptic curves

Jie Zhu, Maozhi Xu
{"title":"A simple method to obtain relations among factor basis elements for special hyperelliptic curves","authors":"Jie Zhu, Maozhi Xu","doi":"10.1109/CITS.2017.8035334","DOIUrl":null,"url":null,"abstract":"The main approach to solve hyperelliptic curve DLP is index calculus algorithm. One of the most important steps is to obtain relations among the factor basis elements. Although Nagao and Joux proposed decomposition methods respectively, their algorithms required solving a multi-variate system of non-linear equations. We propose a new method to find the relations among factor basis elements for a class of special hyperelliptic curves y2+y = x2g+1 + A0 over finite field K with the characteristic 2. Let G(x,y) = R(x)+yT(x) and H(x) be the norm of G(x,y). We prove that supp(div(G(x,y))) ⊆ supp(div(H(x)). Then we show how to obtain relations among factor basis, by solving several linear equations and univariate equations with relatively low degree. Let g be the genus of hyperelliptic curve. After (6g+3)! trials we may obtain a single relation. We also give some examples to illustrate the effectiveness of our algorithm when g = 2,3.","PeriodicalId":314150,"journal":{"name":"2017 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 International Conference on Computer, Information and Telecommunication Systems (CITS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CITS.2017.8035334","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The main approach to solve hyperelliptic curve DLP is index calculus algorithm. One of the most important steps is to obtain relations among the factor basis elements. Although Nagao and Joux proposed decomposition methods respectively, their algorithms required solving a multi-variate system of non-linear equations. We propose a new method to find the relations among factor basis elements for a class of special hyperelliptic curves y2+y = x2g+1 + A0 over finite field K with the characteristic 2. Let G(x,y) = R(x)+yT(x) and H(x) be the norm of G(x,y). We prove that supp(div(G(x,y))) ⊆ supp(div(H(x)). Then we show how to obtain relations among factor basis, by solving several linear equations and univariate equations with relatively low degree. Let g be the genus of hyperelliptic curve. After (6g+3)! trials we may obtain a single relation. We also give some examples to illustrate the effectiveness of our algorithm when g = 2,3.
一种求特殊超椭圆曲线因子基元关系的简单方法
求解超椭圆曲线DLP的主要方法是指数演算算法。其中最重要的步骤之一是获得因子基元之间的关系。虽然Nagao和Joux分别提出了分解方法,但他们的算法需要求解非线性方程的多变量系统。本文提出了在有限域K上求特征为2的一类特殊超椭圆曲线y2+y = x2g+1 + A0的因子基元关系的一种新方法。设G(x,y) = R(x)+yT(x) H(x)是G(x,y)的范数。我们证明了supp(div(G(x,y)))≤supp(div(H(x))。然后,通过求解若干次较低的线性方程和单变量方程,给出了因子基之间的关系。设g为超椭圆曲线的属。后(6 g + 3) !通过试验我们可以得到一个单一的关系。我们还给出了一些例子来说明当g = 2,3时算法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信