{"title":"New Point Compression Algorithms for Binary Curves","authors":"J. C. López-Hernández, R. Dahab","doi":"10.1109/ITW.2006.1633795","DOIUrl":null,"url":null,"abstract":"This paper presents two new algorithms for point compression for elliptic curves defined over F2m, m odd. The first algorithm works for curves with Tr(a) = 1 and offers computational advantages over previous methods. The second algorithm is based on the λ representation of an elliptic point. The proposed algorithms require m bits to compress an elliptic point and can be used for all random binary curves recommended by NIST.","PeriodicalId":293144,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Punta del Este","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 IEEE Information Theory Workshop - ITW '06 Punta del Este","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITW.2006.1633795","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8
Abstract
This paper presents two new algorithms for point compression for elliptic curves defined over F2m, m odd. The first algorithm works for curves with Tr(a) = 1 and offers computational advantages over previous methods. The second algorithm is based on the λ representation of an elliptic point. The proposed algorithms require m bits to compress an elliptic point and can be used for all random binary curves recommended by NIST.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
