二值曲线新的点压缩算法

2006 IEEE Information Theory Workshop - ITW '06 Punta del Este Pub Date : 2006-03-13 DOI:10.1109/ITW.2006.1633795

J. C. López-Hernández, R. Dahab

{"title":"二值曲线新的点压缩算法","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":"{\"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}","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

摘要

本文提出了两种新的椭圆曲线点压缩算法。第一种算法适用于Tr(a) = 1的曲线，并且比以前的方法具有计算优势。第二种算法是基于椭圆点的λ表示。所提出的算法需要m比特来压缩一个椭圆点，并且可以用于NIST推荐的所有随机二进制曲线。

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

查看原文

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

本刊更多论文

New Point Compression Algorithms for Binary Curves

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.

求助全文

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

来源期刊

2006 IEEE Information Theory Workshop - ITW '06 Punta del Este

自引率

0.00%

发文量

期刊最新文献

Backward Channels in Multiterminal Source Coding Regret Minimization Under Partial Monitoring Scaling Law of the Sum-Rate for Multi-Antenna Broadcast Channels with Deterministic or Selective Binary Feedback Non-coherent Mutual Information of the Multipath Rayleigh Fading Channel in the Low SNR Regime Successive Refinement for Pattern Recognition