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

    Title: Cryptanalysis of exhaustive search on attacking RSA
    Authors: Wu, M.-E.;Tso, R.;Sun, H.-M.
    Contributors: 資科系
    Keywords: Computational environments;Exhaustive search;Lattice basis reduction;Lattice reduction;LLL algorithm;Most significant bit;Partial key exposure;RSA;RSA moduli;Artificial intelligence;Network security
    Date: 2012
    Issue Date: 2015-04-17 11:39:48 (UTC+8)
    Abstract: In RSA equation: ed = k·φ(N) + 1, we may guess on partial bits of d or p + q by doing an exhaustive search to further extend the security boundary of d. In this paper, we discuss the following question: Does guessing on p + q bring more benefit than guessing on d? We provide the detailed analysis on this problem by using the lattice reduction technique. Our analysis shows that leaking partial most significant bits (MSBs) of p + q in RSA risks more than leaking partial MSBs of d. This result inspires us to further extend the boundary of the Boneh-Durfee attack to N0.284+Δ, where "Δ" is contributed by the capability of exhaustive search. Assume that doing an exhaustive search for 64 bits is feasible in the current computational environment, the boundary of the Boneh-Durfee attack should be raised to d < N0.328 for an 1024-bit RSA modulus. This is a 37 bits improvement over Boneh and Durfee's boundary. © 2012 Springer-Verlag.
    Relation: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),Volume 7645 LNCS, 373-379
    Data Type: conference
    DOI 連結: http://dx.doi.org/10.1007/978-3-642-34601-9_28
    DOI: 10.1007/978-3-642-34601-9_28
    Appears in Collections:[資訊科學系] 會議論文

    Files in This Item:

    File Description SizeFormat

    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