An efficient modulo $P$ multiplication algorithm with moderate factors of P$+1 and $P$-1

機構典藏 > College of Engineering > Graduate Institute & Department of Computer Science and Information Engineering > Journal Article > Item 987654321/45407

Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/45407

Title:	An efficient modulo $P$ multiplication algorithm with moderate factors of P$+1 and $P$-1
Authors:	Ren-junn Hwang;Feng-fu Su;Sheng-hua Shiau
Contributors:	淡江大學資訊工程學系
Keywords:	modular multiplication;modular exponentiation;RSA cryptosystem;strong prime
Date:	2007-07
Issue Date:	2010-03-26 19:13:33 (UTC+8)
Publisher:	International Press
Abstract:	Modular multiplication plays an important role to several public-key cryptosystems such as the RSA cryptosystem. This paper proposes an efficient modulo $p$ multiplication algorithm with moderate factors of $p$+1 and $p$-1. In order to improve the RSA decryption performance, users can utilize our proposed algorithm and the strong prime criterion. It will prove that the decryption method based on our proposed algorithm can run at a speed almost 6.5 times faster than that of the traditional method, or almost 2 times faster than that of the method based on the Chinese Remainder Theorem. Furthermore, the proposed algorithm can greatly enhance the performance of RSA encryption.
Relation:	Communications in Mathematical Sciences 5(2), 頁383-389
Appears in Collections:	[Graduate Institute & Department of Computer Science and Information Engineering] Journal Article

Files in This Item:

File	Description	Size	Format
An efficient modulo $P$ multiplication algorithm with moderate factors of P$+1 and $P$-1.pdf		146Kb	Adobe PDF	12	View/Open