Sciweavers

AAECC
2004
Springer
76views Algorithms» more  AAECC 2004»
14 years 10 days ago
On the Security of RSA with Primes Sharing Least-Significant Bits
Abstract. We investigate the security of a variant of the RSA public-key cryptosystem called LSBS-RSA, in which the modulus primes share a large number of least-significant bits.We...
Ron Steinfeld, Yuliang Zheng
PKC
2007
Springer
165views Cryptology» more  PKC 2007»
14 years 6 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 decry...
Noboru Kunihiro, Kaoru Kurosawa