Products of two proportional primes

DOI10.1142/S1793042117501445MaRDI QIDQ4595086zbMATH OpenOpenAlexFDO

Authors Pieter Moree, Sumaia Saad Eddin

Publication date 28 November 2017

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

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

zbMATH Keywords

prime numbersRSA-integers

Mathematics Subject Classification ID

Cryptography (94A60) Asymptotic results on arithmetic functions (11N37) Evaluation of number-theoretic constants (11Y60)

Abstract: In RSA cryptography numbers of the form $pq$, with $p$ and $q$ two distinct proportional primes play an important role. For a fixed real number $r>1$ we formalize this by saying that an integer $pq$ is an RSA-integer if $p$ and $q$ are primes satisfying $p<qlerp$. Recently Dummit, Granville and Kisilevsky showed that substantially more than a quarter of the odd integers of the form $pq$ up to $x$, with $p,q$ both prime, satisfy $pequivqequiv3pmod4$. 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 $lex$ which is much more precise than an earlier one derived by Decker and Moree in 2008.

Recommendations

• On the distribution of products of two primes
• Counting RSA-integers
• An approximate expression related with RSA fixed points
• On asymptotic behavior of composite integers \(n=pq\)
• On integer with two prime factors

Cites work

• scientific article; zbMATH DE number 4071027 (Why is no real title available?)
• Big biases amongst products of two primes
• Chebyshev's Bias for Products of Two Primes
• Chebyshev's bias for products of \(k\) primes
• Counting RSA-integers
• CryptoSchool
• On asymptotic behavior of composite integers \(n=pq\)
• On integer with two prime factors
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Prime Number Races

Cited in

(4)

• Constrained ternary integers
• On asymptotic behavior of composite integers \(n=pq\)
• On integer with two prime factors
• On the distribution of products of two primes

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)