Large sieve, Miller-Rabin compositeness witnesses and integer factoring problem

DOI10.3233/FI-2017-1603MaRDI QIDQ4606357zbMATH OpenOpenAlexFDO

Authors 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

\(\mathbb{Z}_n^*\)-generating setsDirichlet charactersdiscrete logarithm problem for composite numbersfactoring algorithmslarge sievesmooth numbers

Mathematics Subject Classification ID

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

Recommendations

• Integer factoring and compositeness witnesses
• On the oracle complexity of factoring integers
• scientific article; zbMATH DE number 3970826
• Reductions among number theoretic problems
• Asymptotically Fast Factorization of Integers

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)