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

DOI10.1007/978-3-540-71677-8_27zbMath1161.94412OpenAlexW1488844414MaRDI QIDQ5756549

Kaoru Kurosawa, Noboru Kunihiro

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

RSALLL algorithmfactoring

Mathematics Subject Classification ID

Cryptography (94A60) Primality (11Y11)

Related Items (1)

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