Small Secret CRT-Exponent Attacks on Takagi's RSA

CRT-RSA is a variant of RSA, which uses integers dp = d mod(p - 1) and dq = d mod(q - 1) (CRT-exponents), where d,p,q are the secret keys of RSA. May proposed a method to obtain the secret key in polynomial time if a CRT-exponent is small, moreover Bleichenbacher and May improved this method. On the...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences Communications and Computer Sciences, 2011/01/01, Vol.E94.A(1), pp.19-27
Hauptverfasser:	SHINOHARA, Naoyuki, IZU, Tetsuya, KUNIHIRO, Noboru
Format:	Artikel
Sprache:	eng
Schlagworte:	CRT-exponent Electronics Heuristic methods Integers Keys lattice LLL Takagi's RSA Upper bounds
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!