An Efficient Method of Factoring Integers

論文翻譯標題: 一個有效率的整數分解法
  • 劉 建甫

學生論文: Master's Thesis

摘要

At the beginning we introduce the most popular public-key cryptosystem called RSA and its application in real life With this cryptosystem there exists much more methods to crack it In this thesis we discuss one of these method in the following called general number field sieve which is also more efficient than others Since the idea of this method is come from Fermat we will introduce some history and compare what different between them Finally we introduce general number field sieve completing its details in practice and show an example by program
獎項日期2014 八月 14
原文English
監督員Po-Yi Huang (Supervisor)

引用此

'