Author:
Guo Wei,Liu Yaling,Bai Songhui,Wei Jizeng,Sun Dazhi
Publisher
Springer Science and Business Media LLC
Reference17 articles.
1. Montgomery P L. Modular multiplication without trial division[J]. Mathematics of Computation, 1985, 44(170): 519–521.
2. Wang Dili, Bai Guoqiang, Chen Hongyi. Hardware architecture for the Montgomery multiplication algorithm[J]. Microelectronics and Computer, 2010, 27(5): 1–4(in Chinese).
3. Hong Jinhua, Wu Chengwen. Cellular-array modular multiplier for fast RSA public-key cryptosystem based on modified Booth’s algorithm[J]. IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2003, 11(3): 474–484.
4. Nozaki Hanae, Motoyama Masahiko, Shimbo Atsushi et al. Implementation of RSA algorithm based on RNS Montgomery multiplication [C]. In: Cryptographic Hardware and Embedded Systems (CHES). Berlin, Germany, 2001. 364–376.
5. Kawamura Shinichi, Koike Masanobu, Sano Fumihiko et al. Cox-rower architecture for fast parallel Montgomery multiplication[C]. In: Advances in Cryptology-EUROCRYPT 2000. Bruges, Belgium, 2000. 523–538.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. RNS-Based Embedded Processor Design;Embedded Systems Design with Special Arithmetic and Number Systems;2017
2. Towards Adaptive Cryptography and Security with Software Defined Platforms;Computing Platforms for Software-Defined Radio;2016-12-30