Large Sieve, Miller-Rabin Compositeness Witnesses and Integer Factoring Problem

DOI10.3233/FI-2017-1603zbMATH Open1434.11234OpenAlexW2766513497MaRDI QIDQ4606357FDOQ4606357

Konrad Durnoga, Jacek Pomykała

Publication date: 2 March 2018

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2017-1603

zbMATH Keywords

large sievesmooth numbersDirichlet charactersdiscrete logarithm problem for composite numbersfactoring algorithms\(\mathbb{Z}_n^*\)-generating sets

Mathematics Subject Classification ID

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

Cited In (2)

• A variant of the large sieve inequality with explicit constants
• Integer factoring and compositeness witnesses

This page was built for publication: Large Sieve, Miller-Rabin Compositeness Witnesses and Integer Factoring Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4606357)