政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/75549
English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  全文筆數/總筆數 : 113648/144635 (79%)
造訪人次 : 51629611      線上人數 : 504
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 查詢小技巧：
  • 您可在西文檢索詞彙前後加上"雙引號"，以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋，建議至進階搜尋限定作者欄位，可獲得較完整資料
    •  進階搜尋
    政大機構典藏 > 資訊學院 > 資訊科學系 > 期刊論文 >  Item 140.119/75549


    請使用永久網址來引用或連結此文件: https://nccur.lib.nccu.edu.tw/handle/140.119/75549


    題名: On the improvement of Fermat factorization using a continued fraction technique
    作者: Wu, M.-E.;Tso, R.;Sun, Hung-Min
    貢獻者: 資科系
    關鍵詞: Composite numbers;Computational capability;Continued fraction;IFP;Integer factorization problem;Integer-N;Prime factors;Hardware;Software engineering;Algorithms
    日期: 2014-01
    上傳時間: 2015-06-03 12:33:11 (UTC+8)
    摘要: Although Integer Factorization Problem (IFP) is one of the most difficult problems in the world due to the limited computational capability, there exist some vulnerable integers which are factorable by the development of cloud computing. For example, given an integer N=pq, which is a product of two primes, it is hard to determine the prime factors p and q efficiently. However, for the suitable size of a number N, Fermat`s algorithm may be one of the simplest method for solving it. In this paper, a method called EPF for estimating the prime factors of a composite number is proposed. We use the technique of continued fractions to output two integers, pE+qE and pE×qE, which are close to p+q and p×q, respectively. Furthermore, we show that EPF can be adopted to reduce the loop count in Fermat`s algorithm before factoring a composite number. The effect depends on the size of the prime factor. We believe that there are still other applications as well wherein EPF can be used. © 2013 Published by Elsevier B.V. All rights reserved.
    關聯: Future Generation Computer Systems, 30, 162-168
    資料類型: article
    DOI 連結: http://dx.doi.org/10.1016/j.future.2013.06.008
    DOI: 10.1016/j.future.2013.06.008
    顯示於類別:[資訊科學系] 期刊論文

    文件中的檔案:

    檔案 描述 大小格式瀏覽次數
    162-168.pdf522KbAdobe PDF2682檢視/開啟


    在政大典藏中所有的資料項目都受到原著作權保護.


    社群 sharing

    著作權政策宣告 Copyright Announcement
    1.本網站之數位內容為國立政治大學所收錄之機構典藏，無償提供學術研究與公眾教育等公益性使用，惟仍請適度，合理使用本網站之內容，以尊重著作權人之權益。商業上之利用，則請先取得著作權人之授權。
    The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

    2.本網站之製作，已盡力防止侵害著作權人之權益，如仍發現本網站之數位內容有侵害著作權人權益情事者，請權利人通知本網站維護人員(nccur@nccu.edu.tw)，維護人員將立即採取移除該數位著作等補救措施。
    NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 回饋