Integer factoring and compositeness witnesses

DOI10.1515/jmc-2019-0023zbMath1468.11244OpenAlexW3080573067MaRDI QIDQ2023317

Maciej Radziejewski, Jacek Pomykała

Publication date: 3 May 2021

Published in: Journal of Mathematical Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/jmc-2019-0023

zbMATH Keywords

RSAlarge sievesmooth numbersDirichlet charactersprimality testingEuler's totient function\(Z_n^*\)-generating setsdiscrete logarithm problem for composite numbersfactoring algorithms

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Factorization (11Y05) Primality (11Y11)

Related Items (1)

On oracle factoring of integers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On reducing factorization to the discrete logarithm problem modulo a composite
• Some remarks on computing the square parts of integers
• Probabilistic algorithm for testing primality
• Riemann's hypothesis and tests for primality
• The number of solutions of \(\varphi (x)=m\)
• Fast multiplication of large numbers
• The least quadratic non residue
• ON THE LEAST n WITH χ(n) ≠ 1
• A deterministic version of Pollard’s $p-1$ algorithm
• ON THE LEAST QUADRATIC NON-RESIDUE
• Large Sieve, Miller-Rabin Compositeness Witnesses and Integer Factoring Problem

This page was built for publication: Integer factoring and compositeness witnesses