{"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":"338 1","pages":"0"},"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}
引用次数: 0
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.