Title :
Research and implementation of four-prime RSA digital signature algorithm
Author :
Zhenjiu Xiao ; Yongbin Wang ; Zhengtao Jiang
Author_Institution :
Sch. of Comput. Sci., Commun. Univ. of China, Beijing, China
fDate :
June 28 2015-July 1 2015
Abstract :
Big module RSA signature algorithm is very popular these years. We try to improve it and get more operation efficiency. We proposed a four-prime Chinese Remainder Theorem (CRT)-RSA digital signature algorithm in this paper. We used the Hash function SHA512 to make message digest. We optimized large number modular exponentiation with CRT combining in Montgomery algorithm. Our experiment shows that our method got good performance. The security analysis shows higher signature efficiency on resistance of common attacks.
Keywords :
digital signatures; public key cryptography; CRT; Chinese remainder theorem; Montgomery algorithm; big module RSA signature algorithm; four-prime RSA digital signature algorithm; modular exponentiation; security analysis; Algorithm design and analysis; Digital signatures; Encryption; Public key cryptography; Chinese remainder theorem; Digital signature; Four prime; Hash function; Montgomery algorithm; RSA encryption algorithm;
Conference_Titel :
Computer and Information Science (ICIS), 2015 IEEE/ACIS 14th International Conference on
Conference_Location :
Las Vegas, NV
DOI :
10.1109/ICIS.2015.7166652
