Optimal bounds for multi-prime -hiding assumption

DOI10.1007/978-3-642-31448-3_1zbMATH Open1305.94079OpenAlexW55292937MaRDI QIDQ2907355FDOQ2907355

Authors: Kaori Tosu, Noboru Kunihiro 

Publication date: 7 September 2012

Published in: Information Security and Privacy (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-31448-3_1

Recommendations

• Improved cryptanalysis of the multi-prime \(\varphi\)-hiding assumption
• Cryptanalysis of multi-prime \(\varPhi \)-hiding assumption
• Improved factoring attacks on multi-prime RSA with small prime difference
• scientific article; zbMATH DE number 1951624
• On the security of multi-prime RSA

zbMATH Keywords

lattice based techniquemulti-prime \(\Phi \)-hiding assumptionRSA-OAEP

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (5)

• On the bounds and achievability about the ODPC of \(\mathrm{GRM}(2,m)^*\) over prime fields for increasing message length
• Instantiability of RSA-OAEP under chosen-plaintext attack
• On the Validity of the Φ-Hiding Assumption in Cryptographic Protocols
• Improved cryptanalysis of the multi-prime \(\varphi\)-hiding assumption
• Cryptanalysis of multi-prime \(\varPhi \)-hiding assumption

This page was built for publication: Optimal bounds for multi-prime \(\Phi \)-hiding assumption

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