基于FPGA的Montgomery模乘器的高效实现
为了提高椭圆曲线密码处理器的模乘速度，提出了一种更有效且更适合硬件实现的Montgomery算法。改进的算法分析了基于CSA加法器的Montgomery模乘算法，提出了多步CSA加法器的Montgomery算法，该算法能够在一个时钟内做多次CSA迭代运算，可以有效地降低时钟个数，进而提高模乘速度。通过ModelSim仿真工具仿真，正确完成一次256位的Montgomery模乘运算只需要16个时钟周期。在Ahera EP3SL200F1517C2 FPGA中的运行结果表明，71．5MHz的时钟频率下，完成一次256位的模乘运算仅需要0．22μs。...
Saved in:
| Published in | 计算机应用研究 Vol. 34; no. 11; pp. 3424 - 3427 |
|---|---|
| Main Author | |
| Format | Journal Article |
| Language | Chinese |
| Published |
西安电子科技大学,西安710071
2017
北京电子科技学院,北京100070%西安电子科技大学,西安,710071%北京电子科技学院,北京,100070 |
| Subjects | |
| Online Access | Get full text |
| ISSN | 1001-3695 |
| DOI | 10.3969/j.issn.1001-3695.2017.11.050 |
Cover
| Abstract | 为了提高椭圆曲线密码处理器的模乘速度，提出了一种更有效且更适合硬件实现的Montgomery算法。改进的算法分析了基于CSA加法器的Montgomery模乘算法，提出了多步CSA加法器的Montgomery算法，该算法能够在一个时钟内做多次CSA迭代运算，可以有效地降低时钟个数，进而提高模乘速度。通过ModelSim仿真工具仿真，正确完成一次256位的Montgomery模乘运算只需要16个时钟周期。在Ahera EP3SL200F1517C2 FPGA中的运行结果表明，71．5MHz的时钟频率下，完成一次256位的模乘运算仅需要0．22μs。 |
|---|---|
| AbstractList | TP309.7; 为了提高椭圆曲线密码处理器的模乘速度,提出了一种更有效且更适合硬件实现的Montgomery算法.改进的算法分析了基于CSA加法器的Montgomery模乘算法,提出了多步CSA加法器的Montgomery算法,该算法能够在一个时钟内做多次CSA迭代运算,可以有效地降低时钟个数,进而提高模乘速度.通过ModelSim仿真工具仿真,正确完成一次256位的Montgomery模乘运算只需要16个时钟周期.在Mtera EP3SL200F1517C2 FPGA中的运行结果表明,71.5 MHz的时钟频率下,完成一次256位的模乘运算仅需要0.22 μs. 为了提高椭圆曲线密码处理器的模乘速度，提出了一种更有效且更适合硬件实现的Montgomery算法。改进的算法分析了基于CSA加法器的Montgomery模乘算法，提出了多步CSA加法器的Montgomery算法，该算法能够在一个时钟内做多次CSA迭代运算，可以有效地降低时钟个数，进而提高模乘速度。通过ModelSim仿真工具仿真，正确完成一次256位的Montgomery模乘运算只需要16个时钟周期。在Ahera EP3SL200F1517C2 FPGA中的运行结果表明，71．5MHz的时钟频率下，完成一次256位的模乘运算仅需要0．22μs。 |
| Abstract_FL | To improve the speed of modular multiplication operation on ECC processor,this paper proposed an improved Montgomery algorithm that was more efficient and suitable for hardware implementation.First,the improved algorithm analyzed the Montgomery modular multiplication algorithm based on CSA adder.Then it presented the multi-step CSA adder Montgomery algorithm,which could do repeatedly CSA iterations in one clock.Therefore,the improved modular multiplication could increase the speed of modular multiplication by reducing the number of clocks.Simulation with ModelSim indicates that an accurate completion of modular multiplication requires only 16 clock circles.And the simulation on Altera EP3SL200F1517C2 FPGA shows that a modular multiplication of 256 bits only takes 0.22 μs under 71.5 MHz clock frequency. |
| Author | 高献伟 张晓楠 董秀则 |
| AuthorAffiliation | 西安电子科技大学,西安710071 北京电子科技学院,北京100070 |
| AuthorAffiliation_xml | – name: 西安电子科技大学,西安710071;北京电子科技学院,北京100070%西安电子科技大学,西安,710071%北京电子科技学院,北京,100070 |
| Author_FL | Zhang Xiaonan Gao Xianwei Dong Xiuze |
| Author_FL_xml | – sequence: 1 fullname: Gao Xianwei – sequence: 2 fullname: Zhang Xiaonan – sequence: 3 fullname: Dong Xiuze |
| Author_xml | – sequence: 1 fullname: 高献伟 张晓楠 董秀则 |
| BookMark | eNo9jz1LAzEAhjNUsK3-CXFwuWu-LmnGUmwVKjp0L-ldcl6wOb0ocruDU7dCdVDcCoK42t_Ta_FfGKk4vfDy8H40QM3mVgFwiGBIBBMtE2bO2RBBiALCRBRiiHiIUAgjWAP1f38XNJwzEFKMBKyDVvW6XC2nvYt-Z_P8cJbb2zSfqKJcL95WX_PqaeHd7_f5evZYfbxspp97YEfLK6f2_7QJhr3jYfckGJz3T7udQRAzCAMdRThOiOQ81lxQyplsYywSiSlDjBKWxKg99pu4wpQyEo2VZJqzhBCmqKakCY62sffSamnTkcnvCusLR8aZsizN7zuE_DePHmzR-DK36U3m4esim8iiHDFOfBfliPwAcqJfZg |
| ClassificationCodes | TP309.7 |
| ContentType | Journal Article |
| Copyright | Copyright © Wanfang Data Co. Ltd. All Rights Reserved. |
| Copyright_xml | – notice: Copyright © Wanfang Data Co. Ltd. All Rights Reserved. |
| DBID | 2RA 92L CQIGP W92 ~WA 2B. 4A8 92I 93N PSX TCJ |
| DOI | 10.3969/j.issn.1001-3695.2017.11.050 |
| DatabaseName | 维普_期刊 中文科技期刊数据库-CALIS站点 维普中文期刊数据库 中文科技期刊数据库-工程技术 中文科技期刊数据库- 镜像站点 Wanfang Data Journals - Hong Kong WANFANG Data Centre Wanfang Data Journals 万方数据期刊 - 香港版 China Online Journals (COJ) China Online Journals (COJ) |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| DocumentTitleAlternate | Efficient implementation of Montgomery modular multiplier on FPGA |
| DocumentTitle_FL | Efficient implementation of Montgomery modular multiplier on FPGA |
| EndPage | 3427 |
| ExternalDocumentID | jsjyyyj201711050 673436471 |
| GrantInformation_xml | – fundername: 北京市自然科学基金资助项目; 北京电子科技学院校内科研基金资助项目 funderid: (4163076); (2014TD41-DXZ) |
| GroupedDBID | -0Y 2B. 2C0 2RA 5XA 5XJ 92H 92I 92L ACGFS ALMA_UNASSIGNED_HOLDINGS CCEZO CQIGP CUBFJ CW9 TCJ TGT U1G U5S W92 ~WA 4A8 93N ABJNI PSX |
| ID | FETCH-LOGICAL-c600-f552cd3a77cf794476a8229da24616436dc18b1007e244635bea6f76d336e4f43 |
| ISSN | 1001-3695 |
| IngestDate | Thu May 29 03:54:51 EDT 2025 Wed Feb 14 09:55:52 EST 2024 |
| IsPeerReviewed | false |
| IsScholarly | true |
| Issue | 11 |
| Keywords | Montgomery modular multiplication algorithm Montgomery模乘算法 迭代运算 elliptic curve cryptography(ECC) 椭圆曲线密码 iterative operation |
| Language | Chinese |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c600-f552cd3a77cf794476a8229da24616436dc18b1007e244635bea6f76d336e4f43 |
| Notes | 51-1196/TP elliptic curve cryptography（ECC） ; Montgomery modular multiplication algorithm; iterative operation Gao Xianwei1,2, Zhang Xiaonan1, Dong Xiuze2 （ 1. Xidian University, Xi＇ an 710071, China ; 2. Beijing Electronics Science ＆ Technology Institute, Beijing 100070, China ） To improve the speed of modular multiplication operation on ECC processor, this paper proposed an improved Montgomery algorithm that was more efficient and suitable for hardware implementation. First, the improved algorithm analyzed the Montgomery modular multiplication algorithm based on CSA adder. Then it presented the multi,step CSA addar Montgomery algorithm, which could do repeatedly CSA iterations in one clock. Therefore, the improved modular multiplication could increase the speed of modular multiplication by reducing the number of clocks. Simulation with ModelSim indicates that an accurate completion of modular multiplication requires only 16 clock circles. And the simulation on Altera EP3 SL200F1517 C2 FPGA shows that a modular |
| PageCount | 4 |
| ParticipantIDs | wanfang_journals_jsjyyyj201711050 chongqing_primary_673436471 |
| PublicationCentury | 2000 |
| PublicationDate | 2017 |
| PublicationDateYYYYMMDD | 2017-01-01 |
| PublicationDate_xml | – year: 2017 text: 2017 |
| PublicationDecade | 2010 |
| PublicationTitle | 计算机应用研究 |
| PublicationTitleAlternate | Application Research of Computers |
| PublicationTitle_FL | Application Research of Computers |
| PublicationYear | 2017 |
| Publisher | 西安电子科技大学,西安710071 北京电子科技学院,北京100070%西安电子科技大学,西安,710071%北京电子科技学院,北京,100070 |
| Publisher_xml | – name: 西安电子科技大学,西安710071 – name: 北京电子科技学院,北京100070%西安电子科技大学,西安,710071%北京电子科技学院,北京,100070 |
| SSID | ssj0042190 ssib001102940 ssib002263599 ssib023646305 ssib051375744 ssib025702191 |
| Score | 2.085944 |
| Snippet | 为了提高椭圆曲线密码处理器的模乘速度，提出了一种更有效且更适合硬件实现的Montgomery算法。改进的算法分析了基于CSA加法器的Montgomery模乘算法，提出了多步CSA加法器... TP309.7; 为了提高椭圆曲线密码处理器的模乘速度,提出了一种更有效且更适合硬件实现的Montgomery算法.改进的算法分析了基于CSA加法器的Montgomery模乘算法,提出了多步CSA... |
| SourceID | wanfang chongqing |
| SourceType | Aggregation Database Publisher |
| StartPage | 3424 |
| SubjectTerms | Montgomery模乘算法 椭圆曲线密码 迭代运算 |
| Title | 基于FPGA的Montgomery模乘器的高效实现 |
| URI | http://lib.cqvip.com/qk/93231X/201711/673436471.html https://d.wanfangdata.com.cn/periodical/jsjyyyj201711050 |
| Volume | 34 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVEBS databaseName: EBSCOhost Academic Search Ultimate issn: 1001-3695 databaseCode: ABDBF dateStart: 20130901 customDbUrl: https://search.ebscohost.com/login.aspx?authtype=ip,shib&custid=s3936755&profile=ehost&defaultdb=asn isFulltext: true dateEnd: 99991231 titleUrlDefault: https://search.ebscohost.com/direct.asp?db=asn omitProxy: true ssIdentifier: ssib025702191 providerName: EBSCOhost |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnR27bhNBcBUcCdHwCogQQEbKlnZ83ne555yJKBCFkdJZd747R5awIXEKp6agSocUKEB0kZAQLfmeOBF_wcze2j6FCAWa1e3c3MzOzT5mR7szhKxjKgejEjzgYDRsUFRa05zlNcZhMDXjDNZAF-3zhdx6xZ9vi-2layulU0v746TeO7j0Xsn_aBVgoFe8JfsPmp0TBQA8g36hBA1DeSUd00hQ06ahpRHHUkftl8-goqiBCofxOu6PXme7ExpJajW1gUM01Gj3qUHgDJtGUA3dK0mNoNrh2IiaCHF0RMNG2ZSlkca3SFM5NOU-bLnmCCwNd8S552IbHmINDecOwRJbYNJCStjGFgi2QBEIgO-RAbSeOXmgcY0FiqYmoJY5-grPb0ROhCIv0syvUVzgdH3QNR_otr2U2vjGhsJBNqlpeGJAGPhp66lajsACx0roo3-SwmBGRc4XP-HjkTImi0SfsxXBu1d9zw9K8zvjxY1vbytAVV22DkEHN24dQh71OQ88SajqGDS2CLZ7IdL3YG8wmUwGiARGGTqilpvoZaqQZRtuhu2FmQtWYTnsYRMjCi22lZgTQJbmcUxUCAvTfB4XAVPCZT0oLBYOL4uoHb6d18m6F2LjbyJgOJKd0bD_Fowsd-dtmMfDfsk869wmN_2-qmqLQXKHLB3s3CW3ZjlLqn4JWyEb0y8npyeHOE7OP71bjJCz46-nP4-mH48B-uvb0dmH99Pvn88Pf9wjnXbUaW3VfNKQWg9s91ouRLOXslhhuC3DuZIxpjRIY4ybCNa3THuBTrATZGDYwm9LsljmSqaMyYznnN0nleFomD0gVZlg9gYgFogU3QhxoxknmUllr5EbwZJVsjYXv_umiA2DxyQ5pmQIVslT_0O6fsbY615U8MMr4KyRG_hceP0ekcp4dz97DHbwOHniu8VvtfyDNg |
| linkProvider | EBSCOhost |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=%E5%9F%BA%E4%BA%8EFPGA%E7%9A%84Montgomery%E6%A8%A1%E4%B9%98%E5%99%A8%E7%9A%84%E9%AB%98%E6%95%88%E5%AE%9E%E7%8E%B0&rft.jtitle=%E8%AE%A1%E7%AE%97%E6%9C%BA%E5%BA%94%E7%94%A8%E7%A0%94%E7%A9%B6&rft.au=%E9%AB%98%E7%8C%AE%E4%BC%9F&rft.au=%E5%BC%A0%E6%99%93%E6%A5%A0&rft.au=%E8%91%A3%E7%A7%80%E5%88%99&rft.date=2017&rft.pub=%E8%A5%BF%E5%AE%89%E7%94%B5%E5%AD%90%E7%A7%91%E6%8A%80%E5%A4%A7%E5%AD%A6%2C%E8%A5%BF%E5%AE%89710071&rft.issn=1001-3695&rft.volume=34&rft.issue=11&rft.spage=3424&rft.epage=3427&rft_id=info:doi/10.3969%2Fj.issn.1001-3695.2017.11.050&rft.externalDocID=jsjyyyj201711050 |
| thumbnail_s | http://utb.summon.serialssolutions.com/2.0.0/image/custom?url=http%3A%2F%2Fimage.cqvip.com%2Fvip1000%2Fqk%2F93231X%2F93231X.jpg http://utb.summon.serialssolutions.com/2.0.0/image/custom?url=http%3A%2F%2Fwww.wanfangdata.com.cn%2Fimages%2FPeriodicalImages%2Fjsjyyyj%2Fjsjyyyj.jpg |