RSA算法中大素数硬件生成方法研究与设计
DOI:
作者:
作者单位:

作者简介:

通讯作者:

中图分类号:

TP309.7

基金项目:


The hardware design research and implementation of big Prime number generation in RSA Algorithm
Author:
Affiliation:

Fund Project:

  • 摘要
  • |
  • 图/表
  • |
  • 访问统计
  • |
  • 参考文献
  • |
  • 相似文献
  • |
  • 引证文献
  • |
  • 资源附件
  • |
  • 文章评论
    摘要:

    在RSA加密算法的硬件设计中,大素数的生成极为关键。本文为了提高RSA算法中大素数的生成效率,在传统筛法的基础上,提出了一种能自动生成确定性大素数的硬件实现算法-循环迭代法,该算法的硬件实现采用状态机架构,使用Verilog HDL语言描述,并通过Modelsim仿真,实验结果表明,使用该方法生成素数序列,具有快速准确,高效,易于硬件实现的特点,为RSA算法的使用提供了极大的便利。

    Abstract:

    As known that it’s very important to generate the big prime number during hardware design of RSA Encryption algorithms. A deterministic algorithm for hardware implementation of big prime number generation automatically is put forward, which is based on conventional screening methods by analyzing a variety of prime numbers. With this method, it can quickly and automatically generate prime numbers in the memory. The state machine framework is adopted for hardware implementation of the algorithm with VerilogHDL description language. The functional verification is one with Modelsim Simulation and the results show that it can automatically generate a prime number sequence quickly and accurately with this method, it provides a rich library of primes for RSA algorithm application.

    参考文献
    相似文献
    引证文献
引用本文

姚霁. RSA算法中大素数硬件生成方法研究与设计[J]. 科学技术与工程, 2013, 13(1): .
yaoji. The hardware design research and implementation of big Prime number generation in RSA Algorithm[J]. Science Technology and Engineering,2013,13(1).

复制
分享
文章指标
  • 点击次数:
  • 下载次数:
  • HTML阅读次数:
  • 引用次数:
历史
  • 收稿日期:2012-05-17
  • 最后修改日期:2012-09-21
  • 录用日期:2012-08-21
  • 在线发布日期: 2012-11-23
  • 出版日期:
×
律回春渐,新元肇启|《科学技术与工程》编辑部恭祝新岁!
亟待确认版面费归属稿件,敬请作者关注