扩展域Fq2上椭圆曲线上标量乘法的改进

2016 IEEE International Conference on Consumer Electronics-Taiwan (ICCE-TW) Pub Date : 2016-05-27 DOI:10.1109/ICCE-TW.2016.7520894

Md. Al-Amin Khandaker, Y. Nogami

{"title":"扩展域Fq2上椭圆曲线上标量乘法的改进","authors":"Md. Al-Amin Khandaker, Y. Nogami","doi":"10.1109/ICCE-TW.2016.7520894","DOIUrl":null,"url":null,"abstract":"In elliptic curve cryptography (ECC), a scalar multiplication for rational point is the most time consuming operation. This paper proposes an efficient calculation for a scalar multiplication by applying Frobenious Mapping. Particularly, this paper deals with Barreto-Naehrig curve defined over extension field Fq2, where q = p6 and p is a large prime.","PeriodicalId":6620,"journal":{"name":"2016 IEEE International Conference on Consumer Electronics-Taiwan (ICCE-TW)","volume":"7 1","pages":"1-2"},"PeriodicalIF":0.0000,"publicationDate":"2016-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An improvement of scalar multiplication on elliptic curve defined over extension field Fq2\",\"authors\":\"Md. Al-Amin Khandaker, Y. Nogami\",\"doi\":\"10.1109/ICCE-TW.2016.7520894\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In elliptic curve cryptography (ECC), a scalar multiplication for rational point is the most time consuming operation. This paper proposes an efficient calculation for a scalar multiplication by applying Frobenious Mapping. Particularly, this paper deals with Barreto-Naehrig curve defined over extension field Fq2, where q = p6 and p is a large prime.\",\"PeriodicalId\":6620,\"journal\":{\"name\":\"2016 IEEE International Conference on Consumer Electronics-Taiwan (ICCE-TW)\",\"volume\":\"7 1\",\"pages\":\"1-2\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-05-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 IEEE International Conference on Consumer Electronics-Taiwan (ICCE-TW)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCE-TW.2016.7520894\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE International Conference on Consumer Electronics-Taiwan (ICCE-TW)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCE-TW.2016.7520894","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

在椭圆曲线密码中，有理点的标量乘法运算是最耗时的运算。本文提出了一种利用Frobenious映射求解标量乘法的有效方法。特别地，本文讨论了在扩展域Fq2上定义的Barreto-Naehrig曲线，其中q = p6, p是一个大素数。

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

查看原文

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

本刊更多论文

An improvement of scalar multiplication on elliptic curve defined over extension field Fq2

In elliptic curve cryptography (ECC), a scalar multiplication for rational point is the most time consuming operation. This paper proposes an efficient calculation for a scalar multiplication by applying Frobenious Mapping. Particularly, this paper deals with Barreto-Naehrig curve defined over extension field Fq2, where q = p6 and p is a large prime.

求助全文

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

来源期刊

2016 IEEE International Conference on Consumer Electronics-Taiwan (ICCE-TW)

自引率

0.00%

发文量

期刊最新文献

Microorganism Image Counting Based on Multi-threshold Optimization An immersive VR experience mode design Methods and apparatuses for drying electronic devices Topology constructing and restructuring mechanisms for Bluetooth radio networks Coordinate system for elliptic curve cryptosystem on twisted Edwards curve