Analysis of RSA over Gaussian integers algorithm

Document Type

Conference Proceeding

Publication Date

5-27-2008

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). © 2008 IEEE.

Identifier

44049085516 (Scopus)

ISBN

[0769530990, 9780769530994]

Publication Title

Proceedings International Conference on Information Technology New Generations Itng 2008

External Full Text Location

https://doi.org/10.1109/ITNG.2008.44

First Page

101

Last Page

105

This document is currently not available here.

Share

COinS