English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 93244/123616 (75%)
Visitors : 27849085      Online Users : 470
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    政大機構典藏 > 理學院 > 資訊科學系 > 期刊論文 >  Item 140.119/75549
    Please use this identifier to cite or link to this item: http://nccur.lib.nccu.edu.tw/handle/140.119/75549

    Title: On the improvement of Fermat factorization using a continued fraction technique
    Authors: Wu, M.-E.;Tso, R.;Sun, Hung-Min
    Contributors: 資科系
    Keywords: Composite numbers;Computational capability;Continued fraction;IFP;Integer factorization problem;Integer-N;Prime factors;Hardware;Software engineering;Algorithms
    Date: 2014-01
    Issue Date: 2015-06-03 12:33:11 (UTC+8)
    Abstract: 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.
    Relation: Future Generation Computer Systems, 30, 162-168
    Data Type: article
    DOI 連結: http://dx.doi.org/10.1016/j.future.2013.06.008
    DOI: 10.1016/j.future.2013.06.008
    Appears in Collections:[資訊科學系] 期刊論文

    Files in This Item:

    File Description SizeFormat
    162-168.pdf522KbAdobe PDF507View/Open

    All items in 政大典藏 are protected by copyright, with all rights reserved.

    社群 sharing

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback