On RSA moduli with half of the bits prescribed

DOI10.1016/J.JNT.2012.07.008zbMath1277.11116OpenAlexW2028904165MaRDI QIDQ1762295

Xian Meng Meng

Publication date: 23 November 2012

Published in: Journal of Number Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jnt.2012.07.008

zbMATH Keywords

RSAbit patternsparse integer

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Randomized algorithms (68W20) Primality (11Y11)

Related Items (2)

A generalization of the Siegel-Walfisz theorem and its application ⋮ Squarefree polynomials with prescribed coefficients

Cites Work

• Unnamed Item
• Unnamed Item
• On RSA moduli with almost half of the bits prescribed
• Short RSA keys and their generation
• On RSA moduli with prescribed bit patterns
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes

This page was built for publication: On RSA moduli with half of the bits prescribed