期刊文献+

嵌入式RSA加解密处理器 被引量:2

Embedded RSA processor for encryption and decryption
原文传递
导出
摘要 RSA加密是一个运算密集的过程 ,为了 CPU能实时进行处理 ,设计了一种嵌入式 RSA处理器 ,它可以在外部微处理器的控制下完成 RSA加解密运算。设计中采用了适合硬件实现的 CIOS方法 ,在保持硬件规模较小的同时加速模乘运算速度。在设计中还采用了窗口法减少模幂运算过程中所需进行的模乘运算次数 ,大大提高了处理速度。在电路的控制逻辑中 ,采取了流水线操作 ,进一步提高了处理速度。在 2 0 MHz的时钟频率下 ,该处理器完成 10 2 4bit的模幂运算最多只需 16 0 ms。电路规模约为 2 6 0 0 0等效逻辑门 。 This paper describes an embedded RSA processor to implement RSA cryptographic processes under the control of an external microprocessor. The coarsely integrated operated scanning method is used to inplement the hardware implementation of Montgomery. The window method is used to significantly reduce the number of modular multiplications needed for completing the modular exponentiation. The control logic circuits use pipelined control to speed up the processing throughput. At a clock rate of 20MHz , this RSA processonr takes at most 160ms to complete a 1024bit modular exponentiation. The processor hardware is approximately equivalent to 26000 logic gates which is suitable for use in various embedded systems.
出处 《清华大学学报(自然科学版)》 EI CAS CSCD 北大核心 2001年第7期110-113,共4页 Journal of Tsinghua University(Science and Technology)
基金 国家自然科学基金资助项目 (5 9995 5 5 0 -0 1) 清华大学"九八五"项目
关键词 公钥密钥算法 RSA算法 模乘运算 CIOS方法 窗口法 嵌入式 加密解处理器 public key crypto algorithm RSA algorithm Montgomery modular multiplication CIOS method Window method embedded
  • 相关文献

参考文献4

共引文献1

同被引文献10

  • 1Koc C K.RSA Hardware Implementation[J].RSA Labs Technical Report TR-801 v1.0,August 1995:201-208. 被引量:1
  • 2Koc C K.High-Speed RSA Implementation[J].RSA Labs Technical Report TR-201 v2.0,November 1994:150-157. 被引量:1
  • 3Montgomery P L.Modular multiplication without trialdivision[J].Mathematics of Computation,1985,44(170):51-95. 被引量:1
  • 4Kaya Koc C,Acar T,Kaliski BSJr.Analyzing and Comparing Montgomery Multiplication Algorithms[J].IEEE Micro,1996,16(3):26-33. 被引量:1
  • 5Tiountchik A A,Trichina E.RSA Acceleration with Field Programmable Gate Arrays[J].Information Security and Privacy,LNCS,1999,1587:164-176. 被引量:1
  • 6Rivest R L, Shamir A, Adleman L. A method for obtaining digital signatures and public-key cryptosystems [J].Communications of the ACM, 1978, 21(2): 120 - 126. 被引量:1
  • 7Kaya Koc C, Acar T, Kaliski B S Jr. Analyzing and comparing Montgomery multiplication algorithms [J]. IEEE Micro, 1996, 16(3): 26-33. 被引量:1
  • 8Dusse S R, Kaliski B S Jr. A cryptographic library for the Motorola DSP56000 [A]. Advances in CryptologyEurocrypt 90, Lecture Notes in Computer Sience [C]. NewYork: Springer-Verlag, 1990. 230- 244. 被引量:1
  • 9Kwon Tack-Won, You Chang-Seok, Heo Won-Seok, et al. Two implementation methods of a 1024-bit RSAcryptoprocessor based on modified Montgomery algorithm[A]. IEEE International Symposium on Circuits and Systems[C]. Sydney, Australia: IEEE, 2001. 650- 653. 被引量:1
  • 10Grossschadl J. The Chinese remainder theorem and its application in a high-speed RSA crypto chip [A]. 16th Annual Conference on Computer Security Applications [C]. New Orleans, USA, 2000. 384 - 393. 被引量:1

引证文献2

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部