An algorithm to enhance security in RSA

扫码查看

原文链接

NETL

外文摘要：In symmetric key cryptography the sender as well as the receiver possess a common key。 Asymmetric key cryptography involves generation of two distinct keys which are used for encryption and decryption correspondingly。 The sender converts the original message to cipher text using the public key while the receiver can decipher this using his private key。 This is also called Public Key Cryptography。 For every public key there can exist only one private key that can decipher the encrypted text。 Security of RSA Algorithm can be compromised using mathematical attack， by guessing the factors of a large number。 It may also be compromised if one can guess the private key。 In accordance with the mathematical attack， we propose a secure algorithm in this paper。 In this algorithm， we try to eliminate the distribution of n which is the large number whose factors if found compromises the RSA algorithm。 We also present a comparative analysis of the proposed algorithm with the RSA algorithm。

外文关键词：

ComplexityEncryptionPrivate keyPublic keyRSASecurity

作者：

Minni, R.、Sultania, K.、Mishra, S.、Vincent, D.R.

展开 >

会议名称：

International Conference on Computing Communication and Networking Technologies

会议地点：

Tiruchengode(IN)

会议母体文献：

2013 Fourth International Conference on Computing Communication and Networking Technologies

页码：

1-4

出版时间：

2013

DOI：

10.1109/ICCCNT.2013.6726517