政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/74659

English | 正體中文 | 简体中文 | Post-Print筆數 : 27 | Items with full text/Total items : 113303/144284 (79%)
Visitors : 50826804 Online Users : 753

RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.

Home ‧ Login ‧ Upload ‧ Help ‧ About ‧ Administer

政大機構典藏 > 資訊學院 > 資訊科學系 > 會議論文 > Item 140.119/74659

Please use this identifier to cite or link to this item: https://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	Size	Format
index.html		0Kb	HTML2	1169	View/Open

社群 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.

Loading...