Analysis of RSA over Gaussian integers algorithm

被引：0
|
作者：
Koval, Aleksey
Verkhovsky, Boris S.
机构：
来源：
PROCEEDINGS OF THE FIFTH INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY: NEW GENERATIONS | 2008年
关键词：
cryptography; RSA; Gaussian integers; Gaussian primes;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
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).
引用
收藏
页码：101 / 105
页数：5
相关论文
共 50 条
12345