构造具有小rho的对友好椭圆曲线

2011 International Conference on Internet Computing and Information Services Pub Date : 2011-09-17 DOI:10.1109/ICICIS.2011.56

Mingqiang Wang, Cai Jie

{"title":"构造具有小rho的对友好椭圆曲线","authors":"Mingqiang Wang, Cai Jie","doi":"10.1109/ICICIS.2011.56","DOIUrl":null,"url":null,"abstract":"In this paper, we provide a method of constructing pairing-friendly elliptic curves on which the optimal pairing can be defined and the resulting curves have small ¦Ñ value approximate to 1. Our algorithm is explicit and works for arbitrary embedding degree k and large prime subgroup order r.","PeriodicalId":255291,"journal":{"name":"2011 International Conference on Internet Computing and Information Services","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Constructing Pairing-friendly Elliptic Curves with Small rho\",\"authors\":\"Mingqiang Wang, Cai Jie\",\"doi\":\"10.1109/ICICIS.2011.56\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we provide a method of constructing pairing-friendly elliptic curves on which the optimal pairing can be defined and the resulting curves have small ¦Ñ value approximate to 1. Our algorithm is explicit and works for arbitrary embedding degree k and large prime subgroup order r.\",\"PeriodicalId\":255291,\"journal\":{\"name\":\"2011 International Conference on Internet Computing and Information Services\",\"volume\":\"32 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-09-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 International Conference on Internet Computing and Information Services\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICICIS.2011.56\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 International Conference on Internet Computing and Information Services","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICICIS.2011.56","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

本文给出了一种构造适合于配对的椭圆曲线的方法，在这种椭圆曲线上可以定义最优配对，并且得到的椭圆曲线具有近似于1的小的Ñ值。该算法是显式的，适用于任意嵌入度k和大素数子群阶r。

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

查看原文本刊更多论文

Constructing Pairing-friendly Elliptic Curves with Small rho

In this paper, we provide a method of constructing pairing-friendly elliptic curves on which the optimal pairing can be defined and the resulting curves have small ¦Ñ value approximate to 1. Our algorithm is explicit and works for arbitrary embedding degree k and large prime subgroup order r.

求助全文

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

来源期刊

2011 International Conference on Internet Computing and Information Services

自引率

0.00%

发文量