Products of two proportional primes
From MaRDI portal
Publication:4595086
DOI10.1142/S1793042117501445zbMATH Open1428.11173arXiv1606.07727OpenAlexW2964284108MaRDI QIDQ4595086FDOQ4595086
Pieter Moree, Sumaia Saad Eddin
Publication date: 28 November 2017
Published in: International Journal of Number Theory (Search for Journal in Brave)
Abstract: In RSA cryptography numbers of the form , with and two distinct proportional primes play an important role. For a fixed real number we formalize this by saying that an integer is an RSA-integer if and are primes satisfying . Recently Dummit, Granville and Kisilevsky showed that substantially more than a quarter of the odd integers of the form up to , with both prime, satisfy . In this paper we investigate this phenomenon for RSA-integers. We establish an analogue of a strong form of the prime number theorem with the logarithmic integral replaced by a variant. From this we derive an asymptotic formula for the number of RSA-integers which is much more precise than an earlier one derived by Decker and Moree in 2008.
Full work available at URL: https://arxiv.org/abs/1606.07727
Recommendations
Cryptography (94A60) Asymptotic results on arithmetic functions (11N37) Evaluation of number-theoretic constants (11Y60)
Cites Work
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Big biases amongst products of two primes
- Prime Number Races
- Counting RSA-integers
- Chebyshev's bias for products of \(k\) primes
- Chebyshev's Bias for Products of Two Primes
- Title not available (Why is that?)
- Title not available (Why is that?)
- CryptoSchool
- Title not available (Why is that?)
Cited In (2)
This page was built for publication: Products of two proportional primes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4595086)