On RSA moduli with almost half of the bits prescribed

DOI10.1016/J.DAM.2007.12.012zbMath1172.11046arXiv0709.2704OpenAlexW2073246935MaRDI QIDQ1003703

Igor E. Shparlinski, Sidney W. Graham

Publication date: 4 March 2009

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0709.2704

zbMATH Keywords

Hadamard matricescharacter sumssparse integerssmooth integersbit patterns

Mathematics Subject Classification ID

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

Related Items (6)

A Fourier-analytic approach to counting partial Hadamard matrices ⋮ A generalization of the Siegel-Walfisz theorem and its application ⋮ Character sums over sparse elements of finite fields ⋮ Prescribing the binary digits of squarefree numbers and quadratic residues ⋮ Squarefree polynomials with prescribed coefficients ⋮ On RSA moduli with half of the bits prescribed

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Short RSA keys and their generation
• On zeros of Dirichlet's \(L\)-series
• On RSA moduli with prescribed bit patterns
• Topics in multiplicative number theory
• Primes in progressions to prime-power modulus
• Large values of Dirichlet polynomials, III
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• A comment on the Hadamard conjecture

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