标题:Security Analysis of an RSA Key Generation Algorithm with a Large Private Key
作者:Kong, Fanyu; Yu, Jia; Wu, Lei
通讯作者:Kong, F
作者机构:[Kong, Fanyu] Shandong Univ, Inst Network Secur, Jinan 250100, Peoples R China.; [Kong, Fanyu] Minist Educ, Key Lab Cryptol Technol & Informat Secur 更多
会议名称:14th Information Security Conference (ISC)
会议日期:OCT 26-29, 2011
来源:INFORMATION SECURITY
出版年:2011
卷:7001
页码:95-101
DOI:10.1007/978-3-642-24861-0_7
关键词:Cryptanalysis; RSA; Key generation algorithm; Lattice basis reduction;; Partial key exposure attack
摘要:In 2003, L. H. Encinas, J. M. Masque and A. Q. Dios proposed an algorithm for generating the RSA modulus N with a large private key d, which was claimed secure. In this paper, we propose an attack on Encinas-Masque-Dios algorithm and find its security flaw. Firstly, we prove that Encinas-Masque-Dios algorithm is totally insecure when the public exponent e is larger than the sum of the two primes p and q. Secondly, we show that when e is larger than N-1/4, Encinas-Masque-Dios algorithm leaks sufficient secret information and then everyone can recover the factorization of the RSA modulus N in polynomial time.
收录类别:CPCI-S;EI;SCOPUS
Scopus被引频次:1
资源类型:会议论文;期刊论文
原文链接:https://www.scopus.com/inward/record.uri?eid=2-s2.0-80054826059&doi=10.1007%2f978-3-642-24861-0_7&partnerID=40&md5=fab7445be50e408190a691de0b144bc7
TOP