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

DOI10.1007/978-3-540-71677-8_27MaRDI QIDQ5756549zbMATH OpenOpenAlexFDO

Authors Noboru Kunihiro, Kaoru Kurosawa

Publication date 4 September 2007

Published in Public Key Cryptography – PKC 2007 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-71677-8_27

zbMATH Keywords

RSAfactoringLLL algorithm

Mathematics Subject Classification ID

Cryptography (94A60) Primality (11Y11)

Recommendations

• Deterministic polynomial-time equivalence of computing the RSA secret key and factoring
• Advances in Cryptology – CRYPTO 2004
• Small Secret Key Attack on a Variant of RSA (Due to Takagi)
• Partial key exposure attacks on Takagi's variant of RSA
• Cryptanalysis of an RSA variant with moduli \(N=p^r q^l\)

Cited in

(4)

• Advances in Cryptology – CRYPTO 2004
• Recovering short secret keys of RLCE in polynomial time
• Deterministic polynomial-time equivalence of computing the RSA secret key and factoring
• Using LLL-reduction for solving RSA and factorization problems

This page was built for publication: Deterministic Polynomial Time Equivalence Between Factoring and Key-Recovery Attack on Takagi’s RSA

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5756549)