Presentation 2009-07-02
Simplified Proof for Small Secret Key Attack on RSA and its Extension
Noboru KUNIHIRO, Kaoru KUROSAWA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) For RSA, Boneh and Durfee proved that if d, N can be factored in polynomial time. Their proof is rather complicated and limited to small secret key attack. So, it is difficult to apply their proof to other similar problems. First, we give a simplified proof for small secret key attack on RSA. Second, we extend the proof technique to more general problems. As a result, we can easily obtain the proof of small secret key attack on Takagi's variant of RSA.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) RSA / Lattice based cryptanalysis / Small Secret Key Attack
Paper # ISEC2009-15,SITE2009-7,ICSS2009-29
Date of Issue

Conference Information
Committee SITE
Conference Date 2009/6/25(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Social Implications of Technology and Information Ethics (SITE)
Language ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Simplified Proof for Small Secret Key Attack on RSA and its Extension
Sub Title (in English)
Keyword(1) RSA
Keyword(2) Lattice based cryptanalysis
Keyword(3) Small Secret Key Attack
1st Author's Name Noboru KUNIHIRO
1st Author's Affiliation The University of Tokyo()
2nd Author's Name Kaoru KUROSAWA
2nd Author's Affiliation Ibaraki University
Date 2009-07-02
Paper # ISEC2009-15,SITE2009-7,ICSS2009-29
Volume (vol) vol.109
Number (no) 114
Page pp.pp.-
#Pages 6
Date of Issue