Affine-Padding Rabin-Oracle Factoring in $L_n\!\left(\frac{1}{3},\sqrt[3]{\frac{32}{9}}\right)$ eprint.iacr.org
Hash padding survives; affine-padded Rabin oracles still fall to an NFS-style factorization in L_n(1/3, ∛32/9).
trending3
01 02 Can Claude actually help break RSA-896, or just babysit CADO-NFS GPU ports and publicize the factorization?03 ePrint preprint on Joux-Naccache-Thomé, forges 1024-bit RSA with a signing oracle and no factoring.