Sciweavers

PKC
2007
Springer

Deterministic Polynomial Time Equivalence Between Factoring and Key-Recovery Attack on Takagi's RSA

13 years 11 months ago
Deterministic Polynomial Time Equivalence Between Factoring and Key-Recovery Attack on Takagi's RSA
Abstract. For RSA, May showed a deterministic polynomial time equivalence of computing d to factoring N(= pq). On the other hand, Takagi showed a variant of RSA such that the decryption algorithm is faster than the standard RSA, where N = pr q while ed = 1 mod (p − 1)(q − 1). In this paper, we show that a deterministic polynomial time equivalence also holds in this variant. The coefficient matrix T to which LLL algorithm is applied is no longer lower triangular, and hence we develop a new technique to overcome this problem.
Noboru Kunihiro, Kaoru Kurosawa
Added 09 Jun 2010
Updated 09 Jun 2010
Type Conference
Year 2007
Where PKC
Authors Noboru Kunihiro, Kaoru Kurosawa
Comments (0)