How strong can primes be
Acta Arithmetica, Tome 179 (2017) no. 4, pp. 363-373
Voir la notice de l'article provenant de la source Institute of Mathematics Polish Academy of Sciences
We prove that there are a positive proportion of primes $p$ such that $p+1$ has a prime factor at least $\sqrt{p}$, $p-1$ has a prime factor $q$ at least $\sqrt{p}$, and $q-1$ has a prime factor at least $p^{0.0705}$. Moreover, there are a positive proportion of primes $p$ such that both $p+1$ and $p-1$ have prime factors at least $p^\theta$ with $\theta={1}/{2}+{1}/{36}.$ These are related to strong primes appearing in RSA schemes.
Keywords:
prove there positive proportion primes has prime factor least sqrt p has prime factor least sqrt q has prime factor least moreover there positive proportion primes p have prime factors least theta theta these related strong primes appearing rsa schemes
Affiliations des auteurs :
Ping Xi 1
@article{10_4064_aa8578_5_2017,
author = {Ping Xi},
title = {How strong can primes be},
journal = {Acta Arithmetica},
pages = {363--373},
publisher = {mathdoc},
volume = {179},
number = {4},
year = {2017},
doi = {10.4064/aa8578-5-2017},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.4064/aa8578-5-2017/}
}
Ping Xi. How strong can primes be. Acta Arithmetica, Tome 179 (2017) no. 4, pp. 363-373. doi: 10.4064/aa8578-5-2017
Cité par Sources :