On RSA moduli with prescribed bit patterns

DOI10.1007/S10623-005-3137-2MaRDI QIDQ2491291zbMATH OpenOpenAlexFDO

Authors 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

bit patternexponential sumRSAsmooth integersparse integer

Mathematics Subject Classification ID

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

Recommendations

• On RSA moduli with half of the bits prescribed
• On RSA moduli with almost half of the bits prescribed
• RSA Moduli with a Predetermined Portion: Techniques and Applications
• Factoring RSA moduli with primes sharing bits in the middle
• scientific article; zbMATH DE number 16481

Cites work

• Factoring integers with elliptic curves
• Finding smooth integers in short intervals using CRT decoding
• scientific article; zbMATH DE number 1302781 (Why is no real title available?)
• On the difference between consecutive primes
• On zeros of Dirichlet's L-series
• Primes in progressions to prime-power modulus
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Smooth numbers: computational number theory and beyond
• Zero-Free Regions for Dirichlet L-Functions, and the Least Prime in an Arithmetic Progression

Cited in

(10)

• On RSA moduli with almost half of the bits prescribed
• Squarefree polynomials with prescribed coefficients
• On RSA moduli with half of the bits prescribed
• Double-speed Barrett moduli
• On Fixed Points of Order K of RSA
• A generalization of the Siegel-Walfisz theorem and its application
• Cryptanalysis of Dual RSA
• Prescribing the binary digits of squarefree numbers and quadratic residues
• RSA Moduli with a Predetermined Portion: Techniques and Applications
• On the distribution of special multiplicative functions in sets of integers with restricted digits

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

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