跳到主要导航 跳到搜索 跳到主要内容

Research in fast modular exponentiation algorithm based on FPGA

  • Shu Li
  • , Jianwei Tian
  • , Hongyu Zhu
  • , Zheng Tian
  • , Hong Qiao
  • , Xi Li
  • , Jie Liu
  • State Grid Corporation of China

科研成果: 书/报告/会议事项章节 › 会议稿件 › 同行评审

8 引用 (Scopus)

摘要

Modular exponentiation of large number is widely applied in public-key cryptosystem, also the bottleneck in the computation of public-key algorithm. Modular multiplication is the key calculation in modular exponentiation. An improved Montgomery algorithm is utilized to achieve modular multiplication and converted into systolic array to increase the running frequency. A high efficiency fast modular exponentiation structure is developed to bring the best out of the modular multiplication module and enhance the ability of defending timing attacks and power attacks. For 1024-bit key operands, the design can be run at 170MHz and finish a modular exponentiation in 4,402,374 clock cycles.

源语言英语
主期刊名Proceedings - 2019 11th International Conference on Measuring Technology and Mechatronics Automation, ICMTMA 2019
出版商Institute of Electrical and Electronics Engineers Inc.
页79-82
页数4
ISBN(电子版)9781728121642
DOI
出版状态已出版 - 4月 2019
已对外发布是
活动11th International Conference on Measuring Technology and Mechatronics Automation, ICMTMA 2019 - Qiqihar, 中国
期限: 28 4月 2019 → 29 4月 2019

丛书

姓名Proceedings - 2019 11th International Conference on Measuring Technology and Mechatronics Automation, ICMTMA 2019

会议

会议11th International Conference on Measuring Technology and Mechatronics Automation, ICMTMA 2019
国家/地区中国
市Qiqihar
时期28/04/19 → 29/04/19

学术指纹

探究 'Research in fast modular exponentiation algorithm based on FPGA' 的科研主题。它们共同构成独一无二的学术指纹。

引用此