Find the Critical value by Hadoop – Case in RSA

• Main Authors: Han-Chung Hsu, 許瀚中
• Other Authors: Ming-Yang Su
• Format: Others
• Language: zh-TW
• Published: 2013
• Online Access: http://ndltd.ncl.edu.tw/handle/6et983

碩士 === 銘傳大學 === 資訊工程學系碩士班 === 101 === In this paper, we implement a cloud computing platform which called Hadoop to accelerate finding RSA roots. We will use Hadoop and brute-force to decrease RSA decryption time. In recent years, Internet and virtualization technology becomes universal. It makes a great environment for cloud computing. Cloud computing means a new type for computer information architecture. We can convert a huge task to several small tasks and send those tasks to computers which is in the cluster of cloud computing. At last, pass the reduce and integrate result to user client. RSA encryption also has been used several years. In recent years, internet becomes popular, so encrypt technology is an important part in internet. Through RSA encryption technology can effectively prevent risk of information be cracked. RSA’s bits are huge, so it takes lots of time to crack by using single computer. Also there don’t have any algorithm can efficiency crack the RSA. So RSA always be a popular public key cryptography. In this experience, we will use a huge dataset with primes. And use Hadoop and brute-force to calculate primes that are in dataset one by one. At last, the result will be the root of RSA.