An extension of a result about divisors in a residue class and its application to reducing integer factorization to computing Euler’s totient
From MaRDI portal
Publication:4612569
DOI10.1090/mcom/3368zbMath1468.11248OpenAlexW2796440028WikidataQ130019352 ScholiaQ130019352MaRDI QIDQ4612569
Publication date: 31 January 2019
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/mcom/3368
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On a problem of Oppenheim concerning Factorisatio Numerorum
- Factoring polynomials with rational coefficients
- Self-witnessing polynomial-time complexity and prime factorization
- Riemann's hypothesis and tests for primality
- Some results on computational complexity
- A deterministic version of Pollard’s $p-1$ algorithm
- LOCAL DENSITIES OVER INTEGERS FREE OF LARGE PRIME FACTORS
- Sums of Divisors, Perfect Numbers and Factoring
- Divisors in residue classes, constructively