New Results on the φ-Hiding Assumption and Factoring Related RSA Moduli

Ask about this paper

Ask your agent about it.

Lune has read the top-tier papers around this one, so every answer names the papers it rests on.

Related papers

• Comparing the Difficulty of Factorization and Discrete Logarithm: A 240-Digit ExperimentFabrice Boudot, Pierrick Gaudry, Aurore Guillevic, Nadia Heninger et al.CRYPTO 2020 · 70 citations
• Post-Quantum Blind Signature from Standard Group Action Assumptions and MoreLucjan Hanzlik, Yi-Fu Lai, Eugenio Paracucchi, Edoardo PersichettiEUROCRYPT 2026 · 1 citation
• Tighter Security for Schnorr Identification and Signatures: A High-Moment Forking Lemma for ${\varSigma }$-ProtocolsLior Rotem, Gil SegevCRYPTO 2021 · 14 citations
• Asynchronous Lagrange-Based Threshold FHE with Smaller Modulus OverheadWon Kim, Changmin Lee, JeongHwan Lee, Alain Passelègue et al.CRYPTO 2026
• One&Done: A Single-Decryption EM-Based Attack on OpenSSL's Constant-Time Blinded RSAMonjur Alam, Haider Adnan Khan, Moumita Dey, Nishith Sinha et al.USENIX Security 2018 · 62 citations