English  |  正體中文  |  简体中文  |  Post-Print筆數 : 11 |  Items with full text/Total items : 88837/118541 (75%)
Visitors : 23546070      Online Users : 362
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/74658
    Please use this identifier to cite or link to this item: http://nccur.lib.nccu.edu.tw/handle/140.119/74658


    Title: On the improvement of fermat factorization
    Authors: Wu, M.-E.;Tso, R.;Sun, H.-M.
    左瑞麟
    Contributors: 資科系
    Keywords: Composite numbers;Continued fraction;Cryptanalysis;Integer factorization;Integer-N;Prime factors;SIMPLE method;Algorithms;Factorization;Network security
    Date: 2012
    Issue Date: 2015-04-17 11:39:43 (UTC+8)
    Abstract: Given an integer N = pq, which is a product of two primes, it is difficult to determine the prime factors p and q efficiently. However, for the suitable size of a number N, Fermat's algorithm is one of the most simple 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. © 2012 Springer-Verlag.
    Relation: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Volume 7645 LNCS, 380-391
    Data Type: conference
    DOI 連結: http://dx.doi.org/10.1007/978-3-642-34601-9_29
    DOI: 10.1007/978-3-642-34601-9_29
    Appears in Collections:[資訊科學系] 會議論文

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML460View/Open


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


    社群 sharing

    著作權政策宣告
    1.本網站之數位內容為國立政治大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,惟仍請適度,合理使用本網站之內容,以尊重著作權人之權益。商業上之利用,則請先取得著作權人之授權。
    2.本網站之製作,已盡力防止侵害著作權人之權益,如仍發現本網站之數位內容有侵害著作權人權益情事者,請權利人通知本網站維護人員(nccur@nccu.edu.tw),維護人員將立即採取移除該數位著作等補救措施。
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback