Title :
Analysis of RSA over Gaussian Integers Algorithm
Author :
Koval, Aleksey ; Verkhovsky, Boris S.
Author_Institution :
New Jersey Inst. of Technol., Newark
Abstract :
In this paper we analyze the extended RSA algorithm into the field of Gaussian integers. We examine in depth the perceived advantages of this extension, such as security and efficiency. We found that the extended RSA is slightly less efficient and could be more secure only if RSA is not as strong as factoring (even in this case it is not guaranteed to add security).
Keywords :
cryptography; Gaussian integers algorithm; Gaussian primes; RSA; cryptography; Algorithm design and analysis; Computer science; Information analysis; Information technology; Public key cryptography; Security; Cryptography; Gaussian Integers; Gaussian primes; RSA;
Conference_Titel :
Information Technology: New Generations, 2008. ITNG 2008. Fifth International Conference on
Conference_Location :
Las Vegas, NV
Print_ISBN :
0-7695-3099-0
DOI :
10.1109/ITNG.2008.44
