18次可拓域上高效算术运算的高耸格式的考虑

Md. Al-Amin Khandaker, Y. Nogami
{"title":"18次可拓域上高效算术运算的高耸格式的考虑","authors":"Md. Al-Amin Khandaker, Y. Nogami","doi":"10.1109/ICCITECHN.2016.7860209","DOIUrl":null,"url":null,"abstract":"Barreto-Naehrig (BN) curve is a well studied pairing friendly curve of embedding degree 12, that uses arithmetic in Fpi2. Therefore the arithmetic of Fp12 extension field is well studied. In this paper, we have proposed an efficient approach of arithmetic operation over the extension field of degree 18 by towering. Fp18 extension field arithmetic is considered to be the basis of implementing the next generation pairing based security protocols. We have proposed to use Fp element to construct irreducible binomial for building tower of extension field up to Fp6, where conventional approach uses the root of previous irreducible polynomial to create next irreducible polynomials. Therefore using Fp elements in irreducible binomial construction, reduces the number of multiplications in Fp to calculate inversion and multiplication over Fp18, which effects acceleration in total arithmetic operation over Fp18.","PeriodicalId":287635,"journal":{"name":"2016 19th International Conference on Computer and Information Technology (ICCIT)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A consideration of towering scheme for efficient arithmetic operation over extension field of degree 18\",\"authors\":\"Md. Al-Amin Khandaker, Y. Nogami\",\"doi\":\"10.1109/ICCITECHN.2016.7860209\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Barreto-Naehrig (BN) curve is a well studied pairing friendly curve of embedding degree 12, that uses arithmetic in Fpi2. Therefore the arithmetic of Fp12 extension field is well studied. In this paper, we have proposed an efficient approach of arithmetic operation over the extension field of degree 18 by towering. Fp18 extension field arithmetic is considered to be the basis of implementing the next generation pairing based security protocols. We have proposed to use Fp element to construct irreducible binomial for building tower of extension field up to Fp6, where conventional approach uses the root of previous irreducible polynomial to create next irreducible polynomials. Therefore using Fp elements in irreducible binomial construction, reduces the number of multiplications in Fp to calculate inversion and multiplication over Fp18, which effects acceleration in total arithmetic operation over Fp18.\",\"PeriodicalId\":287635,\"journal\":{\"name\":\"2016 19th International Conference on Computer and Information Technology (ICCIT)\",\"volume\":\"2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 19th International Conference on Computer and Information Technology (ICCIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCITECHN.2016.7860209\",\"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 19th International Conference on Computer and Information Technology (ICCIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCITECHN.2016.7860209","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

Barreto-Naehrig (BN)曲线是一种嵌入度为12的配对友好曲线,在Fpi2中使用了算法。因此,对Fp12扩展域的算法进行了深入的研究。在本文中,我们提出了一种有效的18次参天扩展域的算术运算方法。Fp18扩展域算法被认为是实现下一代基于配对的安全协议的基础。我们提出使用Fp元素构造不可约二项式来构建Fp6以下的扩展域塔,而传统方法使用前一个不可约多项式的根来创建下一个不可约多项式。因此,在不可约二项结构中使用Fp元素,可以减少Fp18上计算反转和乘法的Fp乘法次数,从而影响Fp18上总算术运算的加速。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A consideration of towering scheme for efficient arithmetic operation over extension field of degree 18
Barreto-Naehrig (BN) curve is a well studied pairing friendly curve of embedding degree 12, that uses arithmetic in Fpi2. Therefore the arithmetic of Fp12 extension field is well studied. In this paper, we have proposed an efficient approach of arithmetic operation over the extension field of degree 18 by towering. Fp18 extension field arithmetic is considered to be the basis of implementing the next generation pairing based security protocols. We have proposed to use Fp element to construct irreducible binomial for building tower of extension field up to Fp6, where conventional approach uses the root of previous irreducible polynomial to create next irreducible polynomials. Therefore using Fp elements in irreducible binomial construction, reduces the number of multiplications in Fp to calculate inversion and multiplication over Fp18, which effects acceleration in total arithmetic operation over Fp18.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Modeling of solar photovoltaic system using MATLAB/Simulink Traffic sign recognition using hybrid features descriptor and artificial neural network classifier Accuracy analysis of recommendation system using singular value decomposition Performance analysis of supervised machine learning algorithms for text classification Fatigue testing of MEMS device developed by MetalMUMPs fabrication process
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1