通过提升计算椭圆曲线离散对数

2013 10th International ISC Conference on Information Security and Cryptology (ISCISC) Pub Date : 2013-08-01 DOI:10.1109/ISCISC.2013.6767331

H. Daghigh, S. Didari, F. S. Shahpar

{"title":"通过提升计算椭圆曲线离散对数","authors":"H. Daghigh, S. Didari, F. S. Shahpar","doi":"10.1109/ISCISC.2013.6767331","DOIUrl":null,"url":null,"abstract":"Index calculus is the best known method for solving discrete logarithm problem(DLP) in general groups. In the elliptic curve case this method uses lifting and dependence relation among lifted rational points to solve DLP. In this paper, we propose an algorithm to find such dependence relation in rank one case.","PeriodicalId":265985,"journal":{"name":"2013 10th International ISC Conference on Information Security and Cryptology (ISCISC)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2013-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Computing elliptic curve discrete logarithm via lifting\",\"authors\":\"H. Daghigh, S. Didari, F. S. Shahpar\",\"doi\":\"10.1109/ISCISC.2013.6767331\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Index calculus is the best known method for solving discrete logarithm problem(DLP) in general groups. In the elliptic curve case this method uses lifting and dependence relation among lifted rational points to solve DLP. In this paper, we propose an algorithm to find such dependence relation in rank one case.\",\"PeriodicalId\":265985,\"journal\":{\"name\":\"2013 10th International ISC Conference on Information Security and Cryptology (ISCISC)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 10th International ISC Conference on Information Security and Cryptology (ISCISC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISCISC.2013.6767331\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 10th International ISC Conference on Information Security and Cryptology (ISCISC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCISC.2013.6767331","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

指数演算是求解一般群离散对数问题的最著名的方法。在椭圆曲线情况下，该方法利用提升和提升有理点之间的依赖关系来求解DLP。在本文中，我们提出了一种在秩一情况下寻找这种依赖关系的算法。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Computing elliptic curve discrete logarithm via lifting

Index calculus is the best known method for solving discrete logarithm problem(DLP) in general groups. In the elliptic curve case this method uses lifting and dependence relation among lifted rational points to solve DLP. In this paper, we propose an algorithm to find such dependence relation in rank one case.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2013 10th International ISC Conference on Information Security and Cryptology (ISCISC)

自引率

0.00%

发文量

期刊最新文献

Optimum decoder for an additive video watermarking with Laplacian noise in H.264 Computing elliptic curve discrete logarithm via lifting A position-based key management scheme for heterogeneous sensor networks On the trade-off between stealth and propagation speed of Internet worms Steganalysis algorithm based on Cellular Automata Transform and Neural Network