全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

A Fast Approach for Breaking RSA Cryptosystem

Keywords: RSA Scheme , Factoring , GCD , Attack , Prime Numbers

Full-Text   Cite this paper   Add to My Lib

Abstract:

Prime numbers play a very important role in the complexity and security of the public key cryptosystem. RSA is one type of public key algorithm and its security depends on the complexity of factoring (n) value. Any encryption algorithm depends on the length of the key and the computational effort required breaking the key.This paper introduces an efficient algorithm to attack the RSA Scheme. Obtaining the private key of the RSA scheme is the target of the suggested algorithm by factoring the modulus based on the public key (e, n) of the RSA scheme. The suggested algorithm is very fast due to its treatments for the factorizing problem. It will limited the search for the p & q values especially when the value of n is small, since most of public key encryption schemes select a small encryption n in order to improve the efficiency and reliability of encryption. The suggested algorithm is more efficient than most existed algorithms of attack since it is break the search process and takes less running time.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133