面向双线性对的<inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML"> <msub>  <mi>F</mi>  <mrow>   <msup>    <mi>p</mi>    <mn>2</mn>   </msup>   </mrow> </msub></math></inline-formula>-FIOS模乘算法及其实现架构研究

姜占鹏; 孙铭玮; 黄海; 徐江; 刘志伟; 白瑞; 方舟; 曲家兴

doi:10.11959/j.issn.1000-436x.2022040

您当前的位置：

首页 >

文章列表页 >

面向双线性对的

F_{p^{2}}

-FIOS模乘算法及其实现架构研究

学术论文 | 更新时间：2024-06-05

- 面向双线性对的 $F_{p^{2}}$ -FIOS模乘算法及其实现架构研究
- Research on $F_{p^{2}}$ -FIOSmodular multiplication algorithm for bilinear pairs and its implementation architecture
- 通信学报 2022年43卷第2期页码：100-108
- 作者机构：
  
  1. 哈尔滨理工大学计算机科学与技术学院，黑龙江哈尔滨 150080
  2. 哈尔滨理工大学电气与电子工程学院，黑龙江哈尔滨 150080
  3. 黑龙江省网络空间研究中心，黑龙江哈尔滨 150090
- 作者简介：
  
  [ "姜占鹏（1984-），男，黑龙江哈尔滨人，博士，哈尔滨理工大学副教授，主要研究方向为嵌入式微处理器和总线接口电路设计等" ]
  [ "孙铭玮（1995-），男，黑龙江密山人，哈尔滨理工大学硕士生，主要研究方向为数字集成电路设计" ]
  [ "黄海（1982-），男，内蒙古巴彦淖尔人，博士，哈尔滨理工大学教授、博士生导师，主要研究方向为信息安全、可重构技术、集成电路设计等" ]
  [ "徐江（1997-），男，山东日照人，哈尔滨理工大学硕士生，主要研究方向为信息安全" ]
  [ "刘志伟（1987-），男，黑龙江哈尔滨人，博士，哈尔滨理工大学讲师，主要研究方向为可重构计算、高速密码算法、并行加密技术、密码芯片的安全设计等" ]
  [ "白瑞（1990-），男，内蒙古海拉尔人，黑龙江省网络空间研究中心工程师，主要研究方向为网络安全、卫星应用、大数据等" ]
  [ "方舟（1983-），女，黑龙江哈尔滨人，博士，黑龙江省网络空间研究中心高级工程师，主要研究方向为物联网内容安全与隐私保护、网络安全、卫星应用、大数据等" ]
  [ "曲家兴（1979-），男，黑龙江哈尔滨人，博士，黑龙江省网络空间研究中心研究员级高级工程师，主要研究方向为物联网内容安全与隐私保护、网络安全、卫星应用、大数据等" ]
- 基金信息：
  
  国家重点研发计划基金资助项目(2018YFB2202100);中央引导地方科技发展专项资金资助项目(ZY20B11);黑龙江省自然科学基金资助项目(YQ2019F010);黑龙江省普通高校基本科研业务费专项资金资助项目(2019KYYWF0214)
- DOI：10.11959/j.issn.1000-436x.2022040
  中图分类号： TN918
- 网络出版日期：2022-02，
  
  纸质出版日期：2022-02-25
- 稿件说明：
移动端阅览
姜占鹏, 孙铭玮, 黄海, 等. 面向双线性对的 $F_{p^{2}}$ -FIOS模乘算法及其实现架构研究[J]. 通信学报, 2022,43(2):100-108.

Zhanpeng JIANG, Mingwei SUN, Hai HUANG, et al. Research on $F_{p^{2}}$ -FIOSmodular multiplication algorithm for bilinear pairs and its implementation architecture[J]. Journal on communications, 2022, 43(2): 100-108.
姜占鹏, 孙铭玮, 黄海, 等. 面向双线性对的 $F_{p^{2}}$ -FIOS模乘算法及其实现架构研究[J]. 通信学报, 2022,43(2):100-108. DOI： 10.11959/j.issn.1000-436x.2022040.

Zhanpeng JIANG, Mingwei SUN, Hai HUANG, et al. Research on $F_{p^{2}}$ -FIOSmodular multiplication algorithm for bilinear pairs and its implementation architecture[J]. Journal on communications, 2022, 43(2): 100-108. DOI： 10.11959/j.issn.1000-436x.2022040.

面向双线性对的

F_{p^{2}}

-FIOS模乘算法及其实现架构研究

PDF下载

摘要

针对双线性对运算效率低的问题，提出了一种面向双线性对的二次扩域细集成操作数扫描（

-FIOS）模乘算法。该算法通过优化二次扩域下(AB+CD)mod P的运算过程，有效降低了模乘中的模约减次数；设计了满足不同应用需求的2种硬件架构及其调度方式以提升算法的计算效率；采用TSMC 55 nm工艺实现了双线性对运算单元。与现有文献相比，所设计的架构在一次模乘时间、时钟频率和面积时间积等性能指标上优于同类模乘设计，在整体Optimal ate对运算实现上也有一定的优势。

Abstract

A quadratic extended-domain finely integrated operand scanning (

-FIOS) modular multiplication algorithm for bilinear pairs was proposed to address the problem of low efficiency of bilinear pair operations.The algorithm effectively reduced the number of modular reductions in modular multiplication by optimizing the operation process of (AB+CD)mod P under the quadratic expansion domain.Two hardware architectures and their scheduling methods were designed to meet different application requirements.In order to improve the computational efficiency of the algorithm

the TSMC 55 nm process was used to realize the bilinear pairing operation unit.Compared with the existing literature

the designed architecture is superior to similar modular multiplication designs in performance indicators such as the first modular multiplication time

clock frequency and the area-time product

and also has certain advantages in the overall Optimal ate pair implementation.

关键词

Keywords

references

SHAMIR A . Identity-based cryptosystems and signature schemes [J ] . Lecture Notes in Computer Science , 1985 , 196 ( 1 ): 47 - 53 .

国家密码管理局 . SM9 标识密码算法第 1 部分：总则:GM/T 0044.1-2016 [S ] . 北京:中国标准出版社 , 2016 .

State Cryptography Administration . Identity-based cryptographic algorithms SM9-part 1:general:GM/T 0044.1-2016 [S ] . Beijing:Standards Press of China , 2016 .

HESS F , SMART N P , VERCAUTEREN F . The eta pairing revisited [J ] . IEEE Transactions on Information Theory , 2006 , 52 ( 10 ): 4595 - 4602 .

LEE E , LEE H S , PARK C M . Efficient and generalized pairing computation on abelian varieties [J ] . IEEE Transactions on Information Theory , 2009 , 55 ( 4 ): 1793 - 1803 .

VERCAUTEREN F . Optimal pairings [J ] . IEEE Transactions on Information Theory , 2010 , 56 ( 1 ): 455 - 461 .

KOBLITZ N , MENEZES A . Pairing-based cryptography at high security levels [C ] // IMA International Conference on Cryptography and Coding . Berlin:Springer , 2005 : 13 - 36 .

BARRETO P S L M , NAEHRIG M . Pairing-friendly elliptic curves of prime order [C ] // International Workshop on Selected Areas in Cryptography . Berlin:Springer , 2005 : 319 - 331 .

ARANHA D F , KARABINA K , LONGA P , et al . Faster explicit formulas for computing pairings over ordinary curves [C ] // Proceedings of the 30th Annual International Conference on Theory and Applications of Cryptographic Techniques:Advances in Cryptology . Berlin:Springer , 2011 : 48 - 68 .

LI Y , HAN J , WANG S , et al . An 800 MHz cryptographic pairing processor in 65 nm CMOS [C ] // Proceedings of 2012 IEEE Asian Solid State Circuits Conference (A-SSCC) . Piscataway:IEEE Press , 2012 : 217 - 220 .

HAN J , LI Y , YU Z Y , et al . A 65 nm cryptographic processor for high speed pairing computation [J ] . IEEE Transactions on Very Large Scale Integration (VLSI) Systems , 2015 , 23 ( 4 ): 692 - 701 .

PANG Y L , ZHANG Y , HAN J , et al . Fp2 arithmetic acceleration based on modified Barrett modular multiplication algorithm [C ] // Proceedings of 2017 IEEE 12th International Conference on ASIC . Piscataway:IEEE Press , 2017 : 561 - 564 .

MIYAMOTO A , HOMMA N , AOKI T , et al . Systematic design of RSA processors based on high-radix Montgomery multipliers [J ] . IEEE Transactions on Very Large Scale Integration (VLSI) Systems , 2011 , 19 ( 7 ): 1136 - 1146 .

KAYA KOC C , ACAR T , KALISKI B S . Analyzing and comparing Montgomery multiplication algorithms [J ] . IEEE Micro , 1996 , 16 ( 3 ): 26 - 33 .

WANG A T , GUO B W , WEI C J . Highly-parallel hardware implementation of optimal ate pairing over Barreto-Naehrig curves [J ] . Integration , 2019 , 64 : 13 - 21 .

HAO Z Y , GUO W , WEI J Z , et al . Dual processing engine architecture to speed up optimal ate pairing on FPGA platform [C ] // Proceedings of 2016 IEEE Trustcom/BigDataSE/ISPA . Piscataway:IEEE Press , 2016 : 584 - 589 .

CHEUNG R C C , DUQUESNE S , FAN J F , et al . FPGA implementation of pairings using residue number system and lazy reduction [C ] // Cryptographic Hardware and Embedded Systems – CHES 2011 . Berlin:Springer , 2011 : 421 - 441 .

BAHADORI M , JÄRVINEN K , . Compact and programmable yet high-performance SoC architecture for cryptographic pairings [C ] // Proceedings of 2020 30th International Conference on Field-Programmable Logic and Applications (FPL) . Piscataway:IEEE Press , 2020 : 176 - 184 .

BAG A , BASU ROY D , PATRANABIS S , et al . FlexiPair:an automated programmable framework for pairing cryptosystems [J ] . IEEE Transactions on Computers , 2022 , 71 ( 3 ): 506 - 519 .

于斌 , 黄海 , 刘志伟 , 等 . 面向多椭圆曲线的高速标量乘法器设计与实现 [J ] . 通信学报 , 2020 , 41 ( 12 ): 100 - 109 .

YU B , HUANG H , LIU Z W , et al . Design and implementation of high-speed scalar multiplier for multi-elliptic curve [J ] . Journal on Communications , 2020 , 41 ( 12 ): 100 - 109 .

王晨宇 , 汪定 , 王菲菲 , 等 . 面向多网关的无线传感器网络多因素认证协议 [J ] . 计算机学报 , 2020 , 43 ( 4 ): 683 - 700 .

WANG C Y , WANG D , WANG F F , et al . Multi-factor user authentication scheme for multi-gateway wireless sensor networks [J ] . Chinese Journal of Computers , 2020 , 43 ( 4 ): 683 - 700 .

WANG Q X , WANG D , CHENG C , et al . Quantum2FA:efficient quantum-resistant two-factor authentication scheme for mobile devices [J ] . IEEE Transactions on Dependable and Secure Computing , 2021 :doi.org/ 10.1109/TDSC.2021.3129512.

LI J H , JIN J , LYU L J , et al . A fast and scalable authentication scheme in IoT for smart living [J ] . Future Generation Computer Systems , 2021 , 117 : 125 - 137 .

NIKRAVAN M , REZA A . A multi-factor user authentication and key agreement protocol based on bilinear pairing for the Internet of things [J ] . Wireless Personal Communications , 2020 , 111 ( 1 ): 463 - 494 .

浏览量

737

下载量

CSCD

文章被引用时，请邮件提醒。

提交

工具集

关联资源

p元扩域上的快速乘法

面向双线性对的 F p 2 -FIOS模乘算法及其实现架构研究

Research on F p 2 -FIOSmodular multiplication algorithm for bilinear pairs and its implementation architecture

DOI：10.11959/j.issn.1000-436x.2022040

摘要

Abstract

关键词

Keywords

references

面向双线性对的 $F_{p^{2}}$ -FIOS模乘算法及其实现架构研究

Research on $F_{p^{2}}$ -FIOSmodular multiplication algorithm for bilinear pairs and its implementation architecture