On RSA moduli with prescribed bit patterns

DOI10.1007/s10623-005-3137-2zbMath1172.11047OpenAlexW2000986731MaRDI QIDQ2491291

Igor E. Shparlinski

Publication date: 29 May 2006

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-005-3137-2

zbMATH Keywords

RSAexponential sumbit patternsparse integersmooth integer

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Exponential sums (11T23) Distribution of integers with specified multiplicative constraints (11N25)

Related Items (8)

A generalization of the Siegel-Walfisz theorem and its application ⋮ Prescribing the binary digits of squarefree numbers and quadratic residues ⋮ Squarefree polynomials with prescribed coefficients ⋮ Cryptanalysis of Dual RSA ⋮ On RSA moduli with half of the bits prescribed ⋮ Double-Speed Barrett Moduli ⋮ On RSA moduli with almost half of the bits prescribed ⋮ RSA Moduli with a Predetermined Portion: Techniques and Applications

Cites Work

• Unnamed Item
• Unnamed Item
• Factoring integers with elliptic curves
• On zeros of Dirichlet's \(L\)-series
• Primes in progressions to prime-power modulus
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Zero-Free Regions for Dirichlet L-Functions, and the Least Prime in an Arithmetic Progression
• Finding smooth integers in short intervals using CRT decoding
• On the difference between consecutive primes

This page was built for publication: On RSA moduli with prescribed bit patterns