Certifying variant of RSA with generalized moduli

DOI10.1007/978-3-030-01950-1_35MaRDI QIDQ2218978zbMATH OpenOpenAlexFDO

Authors Yao Lu, Noboru Kunihiro, Rui Zhang, Liqiang Peng, Hui Ma

Publication date 18 January 2021

Full work available at URL https://doi.org/10.1007/978-3-030-01950-1_35

zbMATH Keywords

Coppersmith's methodlatticesLLL algorithmpublic key cryptosystemRSA

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Certifying RSA
• Efficient noninteractive certification of RSA moduli and beyond
• scientific article; zbMATH DE number 5781969
• Cryptanalysis of an RSA variant with moduli \(N=p^r q^l\)
• On RSA moduli with half of the bits prescribed

Cited in

(2)

• Certifying RSA
• New results on the -hiding assumption and factoring related RSA moduli

This page was built for publication: Certifying variant of RSA with generalized moduli

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